Spectral Bounds for Quasi-Twisted Codes

Autor:	Martianus Frederic Ezerman, Buket Özkaya, San Ling, Jareena Tharnnukhroh
Přispěvatelé:	School of Physical and Mathematical Sciences, 2019 IEEE International Symposium on Information Theory (ISIT)
Rok vydání:	2019
Předmět:	FOS: Computer and information sciences Discrete mathematics Polynomial Computer Science - Information Theory Information Theory (cs.IT) Quasi-twisted Code Roos Bound Minimum distance 020206 networking & telecommunications 0102 computer and information sciences 02 engineering and technology 01 natural sciences Finite field 010201 computation theory & mathematics Computer science and engineering::Information systems [Engineering] 0202 electrical engineering electronic engineering information engineering Spectral analysis Mathematics::Applied mathematics::Information theory [Science] BCH code Eigenvalues and eigenvectors Mathematics
Zdroj:	ISIT
DOI:	10.1109/isit.2019.8849734
Popis:	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. Comment: Accepted ISIT 2019
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::46220d5c41f168d8e3c7e2d23a7d008b https://doi.org/10.1109/isit.2019.8849734 Zobrazit plný text záznamu