Constrained Codes as Networks of Relations
From MaRDI portal
Publication:3604424
DOI10.1109/TIT.2008.920245zbMath1328.94039WikidataQ59903077 ScholiaQ59903077MaRDI QIDQ3604424
Jehoshua Bruck, Moshe Schwartz
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
capacity of constrained systemsFKT methodholographic reductionsnetworks of relationsspectral distribution of Toeplitz matrices
Toeplitz operators, Hankel operators, Wiener-Hopf operators (47B35) Coding theorems (Shannon theory) (94A24)
Related Items (max. 100)
Constrained percolation in two dimensions ⋮ Critical surface of the hexagonal polygon model ⋮ Independence entropy of \(\mathbb{Z}^{d}\)-shift spaces ⋮ The 1-2 model ⋮ Local statistics of realizable vertex models ⋮ Permutations with restricted movement ⋮ Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices ⋮ Mixing time of Markov chains for the 1-2 model
This page was built for publication: Constrained Codes as Networks of Relations