The new results including upper boundary for function of the double symmetric channel reliability at decoding of the fixed capacity by a list at small transmission rates and limitation to the transfer channel probabilities have been obtained. The problems on evaluating number of the linear codes satisfying to the asymptotic-optimal evaluation for the covering radius has been solved. It has been proven that at the greater but fixed volume of the list the decoding by a list in the free-changing channel permits to achieve the positive capacity. The investigation results can be used at analysis of the reliability in the information transmission systems and are the development of the combinatory coding theory on the whole.Available from VNTIC / ...
Ahlswede R, Bassalygo LA, Pinsker MS. Asymptotically optimal binary codes of polynomial complexity c...
AbstractA wide range of problems and both old and new methods are discussed that arise when the tech...
Abstract-A well-known result of Ahlswede asserts that the determinis-tic code capacity of an arbitra...
This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose ...
The block error probability under maximum likelihood decoding of general linear block codes and code...
This paper continues the study of algebraic code capacities, which were introduced by Ahlswede (1971...
Ahlswede R, Gemma J. Bounds on algebraic code capacities for noisy channels. I. Information and Cont...
We derive the optimum second-order coding rates, known as second-order capacities, for erasure and l...
Abstract. In this thesis, error decoding probability bounds and achiev-able rates for linear and non...
In this article, we revisit the classical problem of channel coding and obtain novel results on prop...
Given any pair of arbitrary alphabet channels satisfying coding theorem and its strong converse. The...
Investigation of the data rate, blocklength and error probability interplay for the optimum block co...
A mathematical model is proposed for a postal service which occasionally loses letters. A positive c...
A well-know result of Ahlswede asserts that the deterministic code capacity of an arbitrarily varyin...
International audienceThis paper investigates composite multiterminal networks which consist of a se...
Ahlswede R, Bassalygo LA, Pinsker MS. Asymptotically optimal binary codes of polynomial complexity c...
AbstractA wide range of problems and both old and new methods are discussed that arise when the tech...
Abstract-A well-known result of Ahlswede asserts that the determinis-tic code capacity of an arbitra...
This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose ...
The block error probability under maximum likelihood decoding of general linear block codes and code...
This paper continues the study of algebraic code capacities, which were introduced by Ahlswede (1971...
Ahlswede R, Gemma J. Bounds on algebraic code capacities for noisy channels. I. Information and Cont...
We derive the optimum second-order coding rates, known as second-order capacities, for erasure and l...
Abstract. In this thesis, error decoding probability bounds and achiev-able rates for linear and non...
In this article, we revisit the classical problem of channel coding and obtain novel results on prop...
Given any pair of arbitrary alphabet channels satisfying coding theorem and its strong converse. The...
Investigation of the data rate, blocklength and error probability interplay for the optimum block co...
A mathematical model is proposed for a postal service which occasionally loses letters. A positive c...
A well-know result of Ahlswede asserts that the deterministic code capacity of an arbitrarily varyin...
International audienceThis paper investigates composite multiterminal networks which consist of a se...
Ahlswede R, Bassalygo LA, Pinsker MS. Asymptotically optimal binary codes of polynomial complexity c...
AbstractA wide range of problems and both old and new methods are discussed that arise when the tech...
Abstract-A well-known result of Ahlswede asserts that the determinis-tic code capacity of an arbitra...