Efficient coding schemes for the hard-square model

DOI10.1109/18.915673MaRDI QIDQ4544549zbMATH OpenOpenAlexFDO

Authors Ron M. Roth, Jack Keil Wolf, Paul Siegel

Publication date 4 August 2002

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

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

zbMATH Keywords

capacityconstrained codesenumerative codinghard-square modelmaxentropic probability measurepermutation codesRLL constraintvariable-to-fixed encoder scheme

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Coding theorems (Shannon theory) (94A24) Source coding (94A29)

Recommendations

• Efficient code constructions for certain two-dimensional constraints
• Parallel constrained coding with application to two-dimensional constraints
• Constrained Codes as Networks of Relations
• Improved Bit-Stuffing Bounds on Two-Dimensional Constraints
• Capacity achieving code constructions for two classes of (d,k) constraints

Cited in

(2)

• Capacity of higher-dimensional constrained systems
• A Method for Computing the Merrifield–Simmons Index on Benzenoid Systems

This page was built for publication: Efficient coding schemes for the hard-square model

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