Efficient code constructions for certain two-dimensional constraints

DOI10.1109/18.749031zbMATH Open0945.94007OpenAlexW2127404904MaRDI QIDQ4701335

Tuvi Etzion, Roman Talyansky, Ron M. Roth

Publication date: 21 November 1999

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

Full work available at URL: https://semanticscholar.org/paper/20675d4898f45b81335c86e106ed79d33c3d1d35

zbMATH Keywords

constraintsbalanced arraysencoding algorithmsrunlength-limited constraintstwo-dimensional binary arrays

Mathematics Subject Classification ID

Modulation and demodulation in information and communication theory (94A14)

Related Items (3)

Two-Dimensional Patterns With Distinct Differences—Constructions, Bounds, and Maximal Anticodes ⋮ Improved Bit-Stuffing Bounds on Two-Dimensional Constraints ⋮ Parallel constrained coding with application to two-dimensional constraints

Recommendations

• Two dimensional constacyclic codes of arbitrary length over finite fields 👍 👎
• Bounds on the capacity of constrained two-dimensional codes 👍 👎
• Capacity achieving code constructions for two classes of (d,k) constraints 👍 👎
• Two-dimensional weight-constrained codes through enumeration bounds 👍 👎
• Parallel constrained coding with application to two-dimensional constraints 👍 👎
• On Row-by-Row Coding for 2-D Constraints 👍 👎
• Low Complexity Two-Dimensional Weight-Constrained Codes 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎

This page was built for publication: Efficient code constructions for certain two-dimensional constraints