Long packing and covering codes

Gérard D. Cohen,Iiro S. Honkala,Simon Litsyn,Patrick Solé

IEEE Transactions on Information Theory（1997）

引用 11|浏览0

暂无评分

摘要

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

查看译文

关键词

normalized minimal distance,linear binary code,long packing,unrestricted binary code,mathematics,binary codes,upper bound,information theory

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要