We propose a multilevel coding and multistage decod-ing scheme which is universal for a class of additive noise channels. Then, for a given pair of binary linear codes, we show an upper bound of the decoding er-ror probability. Further, we clarify the condition that the proposed coding and decoding scheme achieves the capacity of the channel and that the decoding error probability vanishes exponentially with code length. 1
We give a polynomial time construction of binary codes with the best currently known trade-off betwe...
We consider coding schemes for computationally bounded channels, which can introduce an arbitrary se...
Abstract — We consider coding schemes for channels with nonuniform inputs (NUI), where standard line...
xi, 113 leavesThe role of channel coding in digital communication system is to provide reliability, ...
A universal decoder for a parametric family of channels is a decoder that for any channel in the fam...
Maximum likelihood decoding of long block codes is not feasable due to large complexity. Some classe...
Various types of multistage decoding for multilevel block modulation codes, in which the decoding of...
In this paper, theoretical upper bounds and computer simulation results on the error performance of ...
Conference PaperIt is well known that MultiLevel Coding (MLC) and MultiStage Decoding (MSD) suffice ...
When concatenated coding schemes operate near channel capacity their component encoders may operate ...
Cover title.Includes bibliographical references (p. 49-51).Supported in part by the Advanced Concept...
In this paper, we consider coding schemes for computationally bounded channels, which can introduce ...
This paper continues the study of algebraic code capacities, which were introduced by Ahlswede (1971...
Abstract. In this thesis, error decoding probability bounds and achiev-able rates for linear and non...
Ahlswede R, Gemma J. Bounds on algebraic code capacities for noisy channels. I. Information and Cont...
We give a polynomial time construction of binary codes with the best currently known trade-off betwe...
We consider coding schemes for computationally bounded channels, which can introduce an arbitrary se...
Abstract — We consider coding schemes for channels with nonuniform inputs (NUI), where standard line...
xi, 113 leavesThe role of channel coding in digital communication system is to provide reliability, ...
A universal decoder for a parametric family of channels is a decoder that for any channel in the fam...
Maximum likelihood decoding of long block codes is not feasable due to large complexity. Some classe...
Various types of multistage decoding for multilevel block modulation codes, in which the decoding of...
In this paper, theoretical upper bounds and computer simulation results on the error performance of ...
Conference PaperIt is well known that MultiLevel Coding (MLC) and MultiStage Decoding (MSD) suffice ...
When concatenated coding schemes operate near channel capacity their component encoders may operate ...
Cover title.Includes bibliographical references (p. 49-51).Supported in part by the Advanced Concept...
In this paper, we consider coding schemes for computationally bounded channels, which can introduce ...
This paper continues the study of algebraic code capacities, which were introduced by Ahlswede (1971...
Abstract. In this thesis, error decoding probability bounds and achiev-able rates for linear and non...
Ahlswede R, Gemma J. Bounds on algebraic code capacities for noisy channels. I. Information and Cont...
We give a polynomial time construction of binary codes with the best currently known trade-off betwe...
We consider coding schemes for computationally bounded channels, which can introduce an arbitrary se...
Abstract — We consider coding schemes for channels with nonuniform inputs (NUI), where standard line...