Fixed-length strategies for the binary multiplying channel

DOI10.1109/18.2640MaRDI QIDQ3798588zbMATH OpenOpenAlexFDO

Authors W. M. C. J. van Overveld

Publication date 1988

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

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

zbMATH Keywords

binary multiplying channelblock codeserror probability

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Error probability in coding theory (94B70) Theory of error-correcting codes and error-detecting codes (94B99)

Recommendations

• The binary multiplying channel--A coding scheme that operates beyond Shannon's inner bound region (Corresp.)
• New rate pairs in the zero-error capacity region of the binary multiplying channel without feedback
• Bounds on the achievable rates of block coding for a memoryless multiple-access channel
• Algebraic Codes Achieving the Capacity of the Binary Symmetric Channel
• scientific article; zbMATH DE number 4110622

Cited in

(3)

• Some aspects of the information theoretic dialogue
• The binary multiplying channel--A coding scheme that operates beyond Shannon's inner bound region (Corresp.)
• New rate pairs in the zero-error capacity region of the binary multiplying channel without feedback

This page was built for publication: Fixed-length strategies for the binary multiplying channel

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