RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive
Probl. Peredachi Inf., 2005 Volume 41, Issue 1, Pages 28–38 (Mi ppi86)
This article is cited in 29 papers

Coding Theory

Code Bounds for Multiple Packings over a Nonbinaxy Finite Alphabet

V. M. Blinovskiiab

a Institute for Information Transmission Problems, Russian Academy of Sciences
b Bielefeld University

Abstract: The problem of constructing asymptotic bounds for multiple packings in the space of $q$-ary sequences of length $n$ is considered. For the zero rate, tightness of the expurgation bound is proved.

UDC: 621.391.15

Received: 05.06.2001
Revised: 16.09.2004


 English version: Problems of Information Transmission, 2005, 41:1, 23–32

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024