A construction of codes with exponential error bounds on arbitrary discrete memoryless channels

DOI10.1109/18.568709MaRDI QIDQ4361463zbMATH OpenOpenAlexFDO

Authors Tomohiko Uyematsu, Eiji Okamoto

Publication date 28 October 1997

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

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

zbMATH Keywords

algebraic geometry codecapacityconcatenated codesJustesen code

Mathematics Subject Classification ID

Combined modulation schemes (including trellis codes) in coding theory (94B12) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Bounds on codes (94B65)

Recommendations

• Constructive codes for arbitrary discrete memoryless channels
• Algebraic Codes Achieving the Capacity of the Binary Symmetric Channel
• Lower bounds to error probability for coding on discrete memoryless channels. I
• Publication:4723668

Cited in

(3)

• Erratum to: ``Bounds on the rate of disjunctive codes
• Algebraic Codes Achieving the Capacity of the Binary Symmetric Channel
• Constructive codes for arbitrary discrete memoryless channels

This page was built for publication: A construction of codes with exponential error bounds on arbitrary discrete memoryless channels

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