On expander codes
From MaRDI portal
Publication:4544525
DOI10.1109/18.910593zbMath1021.94025OpenAlexW1970912697MaRDI QIDQ4544525
Publication date: 4 August 2002
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/ba539d025259257b4ace2390bcc74519c279c4e8
Applications of graph theory (05C90) Combinatorial codes (94B25) Error probability in coding theory (94B70)
Related Items (17)
A new formula for the minimum distance of an expander code ⋮ Linear-time list recovery of high-rate expander codes ⋮ Using low-density parity-check codes to improve the McEliece cryptosystem ⋮ Bounds on the minimum code distance for nonbinary codes based on bipartite graphs ⋮ Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness ⋮ Efficient proofs of retrievability using expander codes ⋮ Unnamed Item ⋮ On codes from hypergraphs. ⋮ AC-RRNS: anti-collusion secured data sharing scheme for cloud storage ⋮ ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES ⋮ The Minimum Distance of Graph Codes ⋮ Eigenvalues and expansion of bipartite graphs ⋮ Low-complexity error correction of Hamming-code-based LDPC codes ⋮ Decoding concatenated codes with inner convolutional codes ⋮ Local correctability of expander codes ⋮ Low-Density Parity-Check Codes Achieve List-Decoding Capacity ⋮ Optimal codes as Tanner codes with cyclic component codes
This page was built for publication: On expander codes
