Distance properties of expander codes
From MaRDI portal
Publication:3546537
DOI10.1109/TIT.2005.860415zbMath1282.94107arXivcs/0409010OpenAlexW2567264041MaRDI QIDQ3546537
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0409010
Related Items (9)
Linear-time list recovery of high-rate expander codes ⋮ Twisted cubic and plane-line incidence matrix in \(\mathrm{PG}(3,q)\) ⋮ Bounds on the minimum code distance for nonbinary codes based on bipartite graphs ⋮ Incidence matrices for the class \({\mathcal{O}}_6\) of lines external to the twisted cubic in \(\mathrm{PG}(3,q)\) ⋮ Some combinatorial aspects of constructing bipartite-graph codes ⋮ AC-RRNS: anti-collusion secured data sharing scheme for cloud storage ⋮ Twisted cubic and point-line incidence matrix in \(\operatorname{PG}(3,q)\) ⋮ On planes through points off the twisted cubic in \(\mathrm{PG}(3,q)\) and multiple covering codes ⋮ Local correctability of expander codes
This page was built for publication: Distance properties of expander codes
