The Extraction and Complexity Limits of Graphical Models for Linear Codes
From MaRDI portal
Publication:3604820
DOI10.1109/TIT.2008.928271zbMath1327.94088arXivcs/0611089OpenAlexW1984512152MaRDI QIDQ3604820
Thomas R. Halford, Keith M. Chugg
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0611089
Analysis of algorithms and problem complexity (68Q25) Linear codes (general theory) (94B05) Bounds on codes (94B65) Graph algorithms (graph-theoretic aspects) (05C85)