The capacity of coded systems

DOI10.1109/18.567656MaRDI QIDQ4336288zbMATH OpenOpenAlexFDO

Authors John T. Coffey, Aaron B. Kiely

Publication date 2 June 1997

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

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

zbMATH Keywords

decodercapacitydata processingencodercomposite channel

Mathematics Subject Classification ID

Communication theory (94A05) Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Capacity of non-malleable codes
• Capacity of non-malleable codes
• The capacity of binary channels that use linear codes and decoders
• Capacity of dimension-limited channels
• Capacity of a communication channel with inner random coding
• Coding capacity for a class of additive channels
• Capacity Limits for Binary Codes in the Presence of Interference
• The Capacity of a Class of Channels With Coded Side Information at the Decoder
• Capacity and decoding rules for classes of arbitrarily varying channels

Cited in

(7)

• Capacity of non-malleable codes
• The capacity and coding gain of certain checkerboard codes
• Capacity and Codes for Embedding Information in Gray-Scale Signals
• The information capacity of hypercycles
• Capacity and coding for the gilbert-elliott channels
• Capacity Limits for Binary Codes in the Presence of Interference
• Capacity Theorems for Distributed Index Coding

This page was built for publication: The capacity of coded systems

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