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
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
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
Spectral Bounds for Quasi-Twisted Codes
Date
2019-01-01
Author
Ezerman, Martianus Frederic
Ling, San
Özkaya, Buket
Tharnnukhroh, Jareena
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
63
views
0
downloads
Cite This
New lower bounds on the minimum distance of quasi-twisted codes over finite fields are proposed. They are based on spectral analysis and eigenvalues of polynomial matrices. They generalize the Semenov-Trifonov and Zeh-Ling bounds in a manner similar to how the Roos and shift bounds extend the BCH and HT bounds for cyclic codes.
Subject Keywords
Quasi-twisted code
,
Roos bound
,
shift bound
,
eigenvalues
,
polynomial matrices
,
spectral analysis
,
MINIMUM DISTANCE
URI
https://hdl.handle.net/11511/103388
DOI
https://doi.org/10.1109/isit.2019.8849734
Conference Name
IEEE International Symposium on Information Theory (ISIT)
Collections
Graduate School of Applied Mathematics, Conference / Seminar
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
M. F. Ezerman, S. Ling, B. Özkaya, and J. Tharnnukhroh, “Spectral Bounds for Quasi-Twisted Codes,” presented at the IEEE International Symposium on Information Theory (ISIT), Paris, Fransa, 2019, Accessed: 00, 2023. [Online]. Available: https://hdl.handle.net/11511/103388.
