A1 Refereed original research article in a scientific journal
Long packing and covering codes
Authors: Cohen G, Honkala I, Litsyn S, Sole P
Publisher: IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Publication year: 1997
Journal: IEEE Transactions on Information Theory
Journal name in source: IEEE TRANSACTIONS ON INFORMATION THEORY
Journal acronym: IEEE T INFORM THEORY
Volume: 43
Issue: 5
First page : 1617
Last page: 1619
Number of pages: 3
ISSN: 0018-9448
DOI: https://doi.org/10.1109/18.623161
Abstract
We study geometrically the domain of linear binary codes and of unrestricted binary codes in the plane (normalized covering radius, normalized minimal distance).
We study geometrically the domain of linear binary codes and of unrestricted binary codes in the plane (normalized covering radius, normalized minimal distance).