This article is cited in 13 papers

Coding Theory

On the Convexity of One Coding-Theory Function

V. M. Blinovsky

A. A. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences

Abstract: The paper completes the proof of an upper bound for multiple packings in a $q$-ary Hamming space

UDC: 621.391.15

Received: 20.11.2007

 English version: Problems of Information Transmission, 2008, 44:1, 34–39

Bibliographic databases:

• 
• 
• 
•