DocumentCode :
936322
Title :
New constructions of codes meeting the Griesmer bound
Author :
Helleseth, Tor
Volume :
29
Issue :
3
fYear :
1983
fDate :
5/1/1983 12:00:00 AM
Firstpage :
434
Lastpage :
439
Abstract :
For any binary linear 
code the Grfesmer bound says that 
. We investigate codes that meet this bound with equality. We give new descriptions of 
codes that have earlier been constructed by Solomon and Stiffler, Belov, and Helleseth and van Tilborg. Finally we show how to construct several new families of such codes with parameters not obtainable by any previous known constructions.
code the Grfesmer bound says that . We investigate codes that meet this bound with equality. We give new descriptions of codes that have earlier been constructed by Solomon and Stiffler, Belov, and Helleseth and van Tilborg. Finally we show how to construct several new families of such codes with parameters not obtainable by any previous known constructions.Keywords :
Linear coding; Information theory;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1983.1056658
Filename :
1056658
Link To Document :
