Open AccessOn linear equivalence and Phelps codes
Author(s) -
Olof Heden,
Martin Hessler
Publication year - 2010
Publication title -
advances in mathematics of communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.601
H-Index - 26
eISSN - 1930-5346
pISSN - 1930-5338
DOI - 10.3934/amc.2010.4.69
Subject(s) - mathematics , rank (graph theory) , equivalence (formal languages) , class (philosophy) , block code , linear code , perfect power , discrete mathematics , combinatorics , algorithm , decoding methods , artificial intelligence , computer science
It is shown that all non-full-rank FRH-codes, a class of perfect codes we define in this paper, are linearly equivalent to perfect codes obtainable by Phelps' construction. Moreover, it is shown by an example that the class of perfect FRH-codes also contains perfect codes that are not obtainable by Phelps construction.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom