A new class of nonbinary codes meeting the Griesmer bound

A new class of nonbinary codes meeting the Griesmer bound

0.00 Avg rating—0 Votes
Article ID: iaor199521
Country: Netherlands
Volume: 47
Issue: 3
Start Page Number: 219
End Page Number: 226
Publication Date: Dec 1993
Journal: Discrete Applied Mathematics
Authors: , ,
Abstract:

A new class of codes over GF(ql) that meet the Griesmer bound are constructed in a simple way from the Solomon and Stiffler codes over GF(q). The new codes are, in general, not equivalent to the Solomon and Stiffler codes whenever l>1.

Reviews

Required fields are marked *. Your email address will not be published.