Hash property and coding theorems for sparse matrices and maximum-likelihood coding

DOI10.1109/TIT.2010.2043781MaRDI QIDQ5281486zbMATH OpenOpenAlexFDO

Authors Jun Muramatsu, Shigeki Miyake

Publication date 27 July 2017

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

Full work available at URL https://doi.org/10.1109/tit.2010.2043781

Mathematics Subject Classification ID

Special matrices (15B99) Coding theorems (Shannon theory) (94A24) Decoding (94B35)

Recommendations

• Corrections to “Hash Property and Coding Theorems for Sparse Matrices and Maximum-Likelihood Coding” [May 10 2143-2167
• Corrections to “Hash Property and Coding Theorems for Sparse Matrices and Maximum-Likelihood Coding” [May 10 2143-2167]
• Hash Property and Fixed-Rate Universal Coding Theorems
• A compact sparse matrix representation using random hash functions
• Sparse hypergraphs with applications to coding theory
• scientific article; zbMATH DE number 1498827
• Good error-correcting codes based on very sparse matrices
• Corrections to “Hash Property and Fixed-Rate Universal Coding Theorems” [Jun 10 2688-2698]
• Hadamard Matrices and Their Designs: A Coding-Theoretic Approach
• Good codes based on very sparse matrices

Cited in

(2)

• Nested linear/lattice codes revisited
• Good codes based on very sparse matrices

This page was built for publication: Hash property and coding theorems for sparse matrices and maximum-likelihood coding

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