Coding for the binary symmetric broadcast channel with two receivers
- 1 September 1985
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 31 (5), 616-625
- https://doi.org/10.1109/tit.1985.1057086
Abstract
Block coding for the binary symmetric broadcast channel with two receivers is investigated. A graph-theoretic approach to the construction of a class of block codes with unequal error protection for two different sets of messages is presented. A code in this class is a direct sum of two component codes; each set of messages is encoded based on one component code. The codes in this class are easy to implement. Decoding of these codes is presented, and lower bounds on the achievable rates of these codes are derived. The bounds are tighter than the Katsman's bounds.Keywords
This publication has 12 references indexed in Scilit:
- Two topics on linear unequal error protection codes: Bounds on their length and cyclic code classesIEEE Transactions on Information Theory, 1983
- A theorem on the entropy of certain binary sequences and applications--IIEEE Transactions on Information Theory, 1973
- Random coding theorem for broadcast channels with degraded componentsIEEE Transactions on Information Theory, 1973
- A class of cyclic unequal error protection codes (Corresp.)IEEE Transactions on Information Theory, 1972
- Unequal error protection codes derived from difference sets (Corresp.)IEEE Transactions on Information Theory, 1972
- Broadcast channelsIEEE Transactions on Information Theory, 1972
- Cyclic codes with unequal error protection (Corresp.)IEEE Transactions on Information Theory, 1971
- On linear unequal error protection codesIEEE Transactions on Information Theory, 1967
- InequalitiesPublished by Springer Nature ,1961
- On the theory of graphsColloquium Mathematicum, 1954