Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
New bounds on the minimum distance of cyclic codes
Date
2021-02-01
Author
Ling, San
Özkaya, Buket
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
33
views
0
downloads
Cite This
Two bounds on the minimum distance of cyclic codes are proposed. The first one generalizes the Roos bound by embedding the given cyclic code into a cyclic product code. The second bound also uses a second cyclic code, namely the non-zero-locator code, but is not directly related to cyclic product codes and it generalizes a special case of the Roos bound.
Subject Keywords
Cyclic codes
,
Minimum distance bound
,
Product code
,
Roos bound
URI
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85099400681&origin=inward
https://hdl.handle.net/11511/103401
Journal
Advances in Mathematics of Communications
DOI
https://doi.org/10.3934/amc.2020038
Collections
Graduate School of Applied Mathematics, Article
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
S. Ling and B. Özkaya, “New bounds on the minimum distance of cyclic codes,”
Advances in Mathematics of Communications
, vol. 15, no. 1, pp. 1–8, 2021, Accessed: 00, 2023. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85099400681&origin=inward.
