Conference paper
Upper bound on the capacity of constrained three-dimensional codes
An upper bound on the capacity of constrained three-dimensional codes is presented. The bound for two-dimensional codes of Calkin and Wilf (see SIAM Journal of Discrete Mathematics, vol.11, no.1, p.54-60, 1998) was extended to three dimensions by Nagy and Zeger. Both bounds apply to first order symmetric constraints.
The bound in three dimensions is generalized in a weaker form to higher order and non-symmetric constraints.
| Language: | English |
|---|---|
| Publisher: | IEEE |
| Year: | 2000 |
| Pages: | 282 |
| Proceedings: | 2000 IEEE International Symposium on Information Theory |
| ISBN: | 0780358570 and 9780780358577 |
| Types: | Conference paper |
| DOI: | 10.1109/ISIT.2000.866580 |
| ORCIDs: | Forchhammer, Søren |
Constraint theory Eigenvalues and eigenfunctions Entropy Symmetric matrices Upper bound capacity codes constrained three-dimensional codes first order symmetric constraints higher order constraints maximum entropy maximum entropy methods nonsymmetric constraints per symbol capacity two-dimensional codes upper bound
