The capacity and coding gain of certain checkerboard codes

DOI10.1109/18.669282MaRDI QIDQ4400339zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

capacitycheckerboard codecoding gainRichardson extrapolationrunlength-limited codestwo-dimensional binary code

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Other types of codes (94B60)

Recommendations

• The capacity of coded systems
• The capacity of low-density parity-check codes under message-passing decoding
• Capacity of non-malleable codes
• Capacity of non-malleable codes
• Asymptotic capacity of two-dimensional channels with checkerboard constraints
• The capacity of binary channels that use linear codes and decoders
• scientific article; zbMATH DE number 1803256
• Bounds on the capacity of constrained two-dimensional codes
• Coding capacity for a class of additive channels
• Algebraic Codes Achieving the Capacity of the Binary Symmetric Channel

Cited in

(8)

• The transfer matrices and the capacity of the 2-dimensional (1, )-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
• Asymptotic capacity of two-dimensional channels with checkerboard constraints
• Entropy of Bit-Stuffing-Induced Measures for Two-Dimensional Checkerboard Constraints
• scientific article; zbMATH DE number 3693152 (Why is no real title available?)
• The limit checker number of a graph

This page was built for publication: The capacity and coding gain of certain checkerboard codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4400339)