A translation of Problemy Peredachi Informatsii

Volume 40, Number 4, October–December, 2004
Back to contents page

CONTENTS                   Powered by MathJax


Analysis of the Dynamics of Iterative Interference Cancellation in Iterative Decoding
M. V. Burnashev, C. B. Schlegel, W. A. Krzymien, and Z. Shi
pp. 297–317

Abstract—Characteristics of a successive cancellation scheme, widely used in iterative decoding, is investigated. Comparison with another popular method, the minimum mean-square error (MMSE) method, is also provided.


Quantum Privacy and Quantum Wiretap Channels
N. Cai, A. Winter, and R. W. Yeung
pp. 318–336

Abstract—Following Schumacher and Westmoreland, we address the problem of the capacity of a quantum wiretap channel. We first argue that, in the definition of the so-called “quantum privacy,” Holevo quantities should be used instead of classical mutual informations. The argument actually shows that the security condition in the definition of a code should limit the wiretapper’s Holevo quantity. Then we show that this modified quantum privacy is the optimum achievable rate of secure transmission.


Classification of Steiner Quadruple Systems of Order 16 and Rank at Most 13
V. A. Zinoviev and D. V. Zinoviev
pp. 337–355

Abstract—A Steiner quadruple system $\operatorname{SQS}(v)$ of order $v$ is a $3$-design $T(v,4,3,\lambda)$ with $\lambda=1$. In this paper we describe all nonisomorphic systems $\operatorname{SQS}(16)$ that can be obtained by the generalized concatenated construction (GC-construction). These Steiner systems have rank at most $13$ over $\mathbb{F}_2$. In particular, there is one system $\operatorname{SQS}(16)$ of rank $11$ (points and planes of the affine geometry $\operatorname{AG}(4,2)$), fifteen systems of rank $12$, and $4131$ systems of rank $13$. All these Steiner systems are resolvable.


On the Error-Detecting Performance of Some Classes of Block Codes
R. Dodunekova, S. M. Dodunekov, and E. Nikolova
pp. 356–364

Abstract—We establish the properness of some classes of binary block codes with symmetric distance distribution, including Kerdock codes and codes that satisfy the Grey–Rankin bound, as well as the properness of Preparata codes, thus augmenting the list of very few known proper nonlinear codes.


Asymptotically Efficient Estimation of Smooth Functionals of the Regression Function for a Known Distribution of the Observation Noise
Yu. I. Pastukhova
pp. 365–378

Abstract—Under the assumption that the distribution function of the observation noise is known, both for the case of a predefined observation design and the case where observation designing is possible, we construct estimates of smooth functionals of the regression function, for which lower bounds on mean-square risks of arbitrary estimates of smooth functionals obtained in [Pastukhova, Yu.I., Zap. Nauchn. Sem. Leningr. Otdel. Mat. Inst. Steklov (LOMI), 1988, vol. 166, pp. 143–154; Pastukhova, Yu.I. and Hasminskii, R.Z, Probl. Control Inf. Theory, 1989, vol. 18, no. 2, pp. 65–77] are asymptotically attained.


pp. 379–382