Partial permutation decoding for the first-order Reed-Muller codes

被引：9

作者：

Seneviratne, P. ^{[1
]}

机构：

[1] Amer Univ Sharjah, Sharjah, U Arab Emirates

来源：

DISCRETE MATHEMATICS | 2009年 / 309卷 / 08期

关键词：

Permutation decoding; PD-sets; Reed-Muller codes; SETS;

D O I：

10.1016/j.disc.2008.03.027

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Partial permutation decoding is shown to apply to the first-order Reed-Muller codes R(1, m), where in > 4 by finding s-PD-sets for these codes for 2 <= s <= 4. (C) 2008 Elsevier B.V. All rights reserved.

引用

页码：1967 / 1970

页数：4

共 8 条

[1]

[Anonymous], 1983, THEORY ERROR CORRECT

[2]

Assmus Jr. E.F., 1992, CAMBRIDGE TRACTS MAT, V103

[3] MINIMAL PERMUTATION SETS FOR DECODING THE BINARY GOLAY CODES [J].

GORDON, DM .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1982, 28 (03) :541-543

[4]

Huffman WC, 1998, HANDBOOK OF CODING THEORY, VOLS I & II, P1345

[5] Information sets and partial permutation decoding for codes from finite geometries [J].

Key, JD ;

McDonough, TP ;

Mavron, VC .

FINITE FIELDS AND THEIR APPLICATIONS, 2006, 12 (02) :232-247

[6] Partial permutation decoding for codes from finite planes [J].

Key, JD ;

McDonough, TP ;

Mavron, VC .

EUROPEAN JOURNAL OF COMBINATORICS, 2005, 26 (05) :665-682

[7]

MacWilliams F. J., 1964, BELL SYST TECH J, V43, P485

[8] ON COVERINGS [J].

SCHONHEIM, J .

PACIFIC JOURNAL OF MATHEMATICS, 1964, 14 (04) :1405-+

← 1 →