List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
From MaRDI portal
Publication:1780828
DOI10.1007/b104335zbMath1075.94001OpenAlexW1580365030MaRDI QIDQ1780828
Publication date: 13 June 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b104335
binary codesminimum distanceJohnson-Type Boundslist decoding radiusmulti-concatenated codesnoise model of erasurespseudolinear codesReed- Solomon and Algebraic codes
Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Decoding (94B35)
Related Items (21)
Linear-time list recovery of high-rate expander codes ⋮ List Decoding of Binary Codes–A Brief Survey of Some Recent Results ⋮ Limits to List Decoding Random Codes ⋮ List-decoding Barnes-Wall lattices ⋮ Some properties of antistochastic strings ⋮ Traceability codes and their generalizations ⋮ An Hybrid Approach for Efficient Multicast Stream Authentication over Unsecured Channels ⋮ Fusion systems and constructing free actions on products of spheres ⋮ Singleton-type bounds for list-decoding and list-recovery, and related results ⋮ List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise ⋮ Efficient List Decoding of Explicit Codes with Optimal Redundancy ⋮ List decoding of Reed-Solomon codes from a Gröbner basis perspective ⋮ List Decoding for Binary Goppa Codes ⋮ Multiple packing in sum-type metric spaces ⋮ List decoding of number field codes ⋮ List decodability at small radii ⋮ Parallel and concurrent security of the HB and \(HB^{+}\) protocols ⋮ Concatenated kernel codes ⋮ Improvements on the Johnson bound for Reed-Solomon codes ⋮ Simplified High-Speed High-Distance List Decoding for Alternant Codes ⋮ Algorithm for calculating the roots of polynomials with coefficients in the ring of polynomials over an arbitrary integral domain
This page was built for publication: List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition