Long packing and covering codes

: Cohen G, Honkala I, Litsyn S, Sole P

Publisher: IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC

: 1997

: IEEE Transactions on Information Theory

: IEEE TRANSACTIONS ON INFORMATION THEORY

: IEEE T INFORM THEORY

: 43

: 5

: 1617

: 1619

: 3

: 0018-9448

DOI: https://doi.org/10.1109/18.623161(external)

We study geometrically the domain of linear binary codes and of unrestricted binary codes in the plane (normalized covering radius, normalized minimal distance).

Mathematics