The capacity and coding gain of certain checkerboard codes
From MaRDI portal
Publication:4400339
DOI10.1109/18.669282zbMath0923.94042MaRDI QIDQ4400339
William Weeks, IV, Richard E. Blahut
Publication date: 18 October 1998
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.669282
capacity; coding gain; Richardson extrapolation; runlength-limited codes; checkerboard code; two-dimensional binary code
Related Items
The transfer matrices and the capacity of the 2-dimensional \((1, \infty)\)-runlength limited constraint, New upper and lower bounds on the channel capacity of read/write isolated memory, Theory of computation of multidimensional entropy with an application to the monomer-dimer problem, Capacity of Higher-Dimensional Constrained Systems