Two-dimensional weight-constrained codes through enumeration bounds

DOI10.1109/18.850669MaRDI QIDQ4501749zbMATH OpenOpenAlexFDO

Authors Erik Ordentlich, Ron M. Roth

Publication date 7 September 2000

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/675db18185918226a9991fed4c362c2c997edbd3

zbMATH Keywords

redundancyenumerative codingbalanced codestwo-dimensional codingcoding algorithmenumeration boundsweight-constrained codes

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Source coding (94A29) Other types of codes (94B60)

Recommendations

• Efficient code constructions for certain two-dimensional constraints
• scientific article; zbMATH DE number 5010762
• Bounds on the capacity of constrained two-dimensional codes
• Upper bounds on the cardinality of a binary code with a given minimum distance
• scientific article; zbMATH DE number 1756448

Cited in

(17)

• Balanced reconstruction codes for single edits
• Asymptotic enumeration of integer matrices with large equal row and column sums
• On existence of two classes of generalized Howell designs with block size three and index two
• Comparing the strength of query types in property testing: the case of \(k\)-colorability
• Asymptotic enumeration of dense 0-1 matrices with specified line sums
• Capacity of higher-dimensional constrained systems
• scientific article; zbMATH DE number 1756448 (Why is no real title available?)
• Product construction of affine codes
• A proof of the upper matching conjecture for large graphs
• Efficient code constructions for certain two-dimensional constraints
• Parallel constrained coding with application to two-dimensional constraints
• Two-Dimensional Patterns With Distinct Differences—Constructions, Bounds, and Maximal Anticodes
• Reducing the local alphabet size in tiling systems by means of 2D comma-free codes
• Two series of equitable symbol weight codes meeting the Plotkin bound
• Improved Bit-Stuffing Bounds on Two-Dimensional Constraints
• Local maxima and improved exact algorithm for MAX-2-SAT
• On the threshold problem for Latin boxes

This page was built for publication: Two-dimensional weight-constrained codes through enumeration bounds

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