Two-dimensional weight-constrained codes through enumeration bounds
From MaRDI portal
Publication:4501749
DOI10.1109/18.850669zbMath1001.94051MaRDI QIDQ4501749
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
redundancy; enumerative coding; balanced codes; two-dimensional coding; coding algorithm; enumeration bounds; weight-constrained codes
Related Items
Unnamed Item, On the threshold problem for Latin boxes, 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, A proof of the upper matching conjecture for large graphs, On existence of two classes of generalized Howell designs with block size three and index two, Asymptotic enumeration of dense 0-1 matrices with specified line sums, Product Construction of Affine Codes, Capacity of Higher-Dimensional Constrained Systems