Minimal and maximal cyclic codes of length 2p

dc.contributor.authorLakhdar Heboub
dc.contributor.authorDouadi Mihoubi
dc.date.accessioned2024-02-14T10:04:36Z
dc.date.available2024-02-14T10:04:36Z
dc.date.issued2022
dc.description.abstractIn this paper, we compute the maximal and minimal codes of length 2p over finite fields q  with p and q are distinct odd primes and f( )= 1 p p − is the multiplicative order of q modulo 2p. We show that, every cyclic code is a direct sum of minimal cyclic codesen_US
dc.identifier.urihttp://dspace.univ-msila.dz:8080//xmlui/handle/123456789/42322
dc.subjectLinear and cyclic codes, Cyclotomic classes, Decomposition of ideals in semi-simple algebras.en_US
dc.titleMinimal and maximal cyclic codes of length 2pen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
The article.pdf
Size:
219.28 KB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: