Advertisement
Published in:
2009 | OriginalPaper | Chapter
The Minimum Hamming Distance of Cyclic Codes of Length 2p s
Authors : Hakan Özadam, Ferruh Özbudak
Published in: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We study cyclic codes of length 2
p
s
over
$\mathbb {F}_{q}$
, where
p
is an odd prime. Using the results of [1], we compute the minimum Hamming distance of these codes.