Two-dimensional weight-constrained codes through enumeration bounds

DOI10.1109/18.850669zbMath1001.94051OpenAlexW2111550877MaRDI QIDQ4501749

Ron M. Roth, Erik Ordentlich

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

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

Related Items (9)

Capacity of Higher-Dimensional Constrained Systems ⋮ Product Construction of Affine Codes ⋮ Asymptotic enumeration of integer matrices with large equal row and column sums ⋮ Comparing the strength of query types in property testing: the case of \(k\)-colorability ⋮ On existence of two classes of generalized Howell designs with block size three and index two ⋮ A proof of the upper matching conjecture for large graphs ⋮ Asymptotic enumeration of dense 0-1 matrices with specified line sums ⋮ Unnamed Item ⋮ On the threshold problem for Latin boxes

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