Efficient code constructions for certain two-dimensional constraints
From MaRDI portal
Recommendations
- Two-dimensional weight-constrained codes through enumeration bounds
- Parallel constrained coding with application to two-dimensional constraints
- Low Complexity Two-Dimensional Weight-Constrained Codes
- scientific article; zbMATH DE number 1756448
- Bounds on the capacity of constrained two-dimensional codes
- scientific article; zbMATH DE number 1789834
- On Row-by-Row Coding for 2-D Constraints
- Capacity achieving code constructions for two classes of (d,k) constraints
- Two dimensional constacyclic codes of arbitrary length over finite fields
- scientific article; zbMATH DE number 5228183
Cited in
(12)- Two-dimensional low-pass filtering codes
- A new construction of two-dimensional arrays with the window property
- Improved Bit-Stuffing Bounds on Two-Dimensional Constraints
- On determining the independent point set for doubly periodic arrays and encoding two-dimensional cyclic codes and their duals
- Two-dimensional weight-constrained codes through enumeration bounds
- scientific article; zbMATH DE number 1756448 (Why is no real title available?)
- Efficient coding schemes for the hard-square model
- Algorithms to enumerate codewords for DC/sup 2/-constrained channels
- Parallel constrained coding with application to two-dimensional constraints
- Conservative arrays: multidimensional modulation codes for holographic recording
- Two-Dimensional Patterns With Distinct Differences—Constructions, Bounds, and Maximal Anticodes
- Efficient Construction of 2-Chains with a Prescribed Boundary
This page was built for publication: Efficient code constructions for certain two-dimensional constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701335)
