Distance Verification for Classical and Quantum LDPC Codes

DOI10.1109/TIT.2017.2690381MaRDI QIDQ5347951zbMATH OpenOpenAlexFDO

Authors Olga Kapralova, I. I. Dumer

Publication date 25 August 2017

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

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• Spherically Punctured Biorthogonal Codes
• Binary Reed-Muller codes and Hamming spheres
• Spherical codes and Borsuk's conjecture
• scientific article; zbMATH DE number 3695083
• Finding and investigating exact spherical codes
• Reed-Muller Codes
• Asymptotic bounds for spherical codes
• Constructive spherical codes near the Shannon bound
• scientific article; zbMATH DE number 177875
• Rigidity of spherical codes

Cited in

(8)

• On the weightwise nonlinearity of weightwise perfectly balanced functions
• Binary Reed-Muller codes and Hamming spheres
• Robust Generalized Punctured Cubic Codes
• Homology-changing percolation transitions on finite graphs
• Duality and free energy analyticity bounds for few-body Ising models with extensive homology rank
• Spherically Punctured Biorthogonal Codes
• Parameterization of Boolean functions by vectorial functions and associated constructions
• On the cryptographic properties of weightwise affine and weightwise quadratic functions

This page was built for publication: Distance Verification for Classical and Quantum LDPC Codes

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