GREEDY CODES

被引：33

作者：

BRUALDI, RA ^{[1
]}

PLESS, VS ^{[1
]}

机构：

[1] UNIV ILLINOIS,DEPT MATH,CHICAGO,IL 60680

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES A | 1993年 / 64卷 / 01期

基金：

美国国家科学基金会;

关键词：

D O I：

10.1016/0097-3165(93)90085-M

中图分类号：

O1 [数学];

学科分类号：

0701 [数学]; 070101 [基础数学];

摘要：

Given an ordered basis of F2n and an integer d, we define a greedy algorithm for constructing a code of minimum distance at least d. We show that these greedy codes are linear and construct a parity check matrix for them. For ordered bases which have a triangular form we are able to give a lower bound on the dimension of greedy codes. Lexicodes are instances of greedy codes. There are examples of greedy codes which are better than lexicodes. © 1993, Academic Press. All rights reserved.

引用

页码：10 / 30

页数：21

共 8 条

[1]

Berlekamp E. R., 1982, WINNING WAYS

[2]

BERLEKAMP ER, 1982, WINNING WAYS, V1

[3]

INTEGRAL LEXICOGRAPHIC CODES [J].