Coding Schemes for Input-Constrained Channels in Information Theory and Communication

Learn about coding schemes for binary input-constrained channels in this technical lecture from V. Arvind Rameshwar at IISc Bangalore. Explore recent developments in coding schemes that address intersymbol interference in magnetic and optical recording, simultaneous energy and information transfer, and synchronization timing for multimedia streams. Dive into constrained coding schemes for memoryless stochastic noise channels, focusing on runlength-limited (RLL) constraints using Reed-Muller code variants. Understand how Fourier analysis of Boolean functions helps calculate sizes of constrained subcodes of linear codes. Examine input-constrained adversarial bit-flip error and erasure channels, discovering numerical upper bounds on constrained code sizes with error resilience through linear programming bounds. Gain insights from Rameshwar, a Prime Minister's Research Fellowship recipient and award-winning researcher whose work spans information theory and coding for channels with memory.