Long packing and covering codes

Authors:
G. Cohen;I. Honkala;S. Litsyn;P. Sole
Affiliations:
Ecole Nat. Superieure des Telecommun., Paris;-;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 2

Some Upper Bounds on the Covering Radii of Linear CodesOver \F_q and Their Applications

Designs, Codes and Cryptography
On the Structure of Small Motif Recognition Instances

SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval

Quantified Score

Hi-index	754.84

Visualization

Abstract

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