Efficient coding schemes for the hard-square model

DOI10.1109/18.915673zbMath1003.94013OpenAlexW2157059597MaRDI QIDQ4544549

Jack Keil Wolf, Ron M. Roth, Paul H. 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 codespermutation codesenumerative codinghard-square modelmaxentropic probability measureRLL 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)

Related Items (2)

A Method for Computing the Merrifield–Simmons Index on Benzenoid Systems ⋮ Capacity of Higher-Dimensional Constrained Systems

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