On negacyclic MDS-convolutional codes

descriptionPublicationkeyboard_double_arrow_right Article , Preprint 01 May 2014Embargo end date: 01 Jan 2013 English Publisher:Elsevier BVJournal:Linear Algebra and its Applications, volume 448, pages 85-96 (issn: 0024-3795,

Copyright policy )

Authors: Giuliano Gadioli La Guardia;

doi: 10.1016/j.laa.2014.01.033 , 10.48550/arxiv.1310.3265

arXiv: 1310.3265

On negacyclic MDS-convolutional codes

- Summary
- Subjects
- Metrics

Abstract

New families of classical and quantum optimal negacyclic convolutional codes are constructed in this paper. This optimality is in the sense that they attain the classical (quantum) generalized Singleton bound. The constructions presented in this paper are performed algebraically and not by computational search.

arXiv admin note: substantial text overlap with arXiv:1212.4654. Accepted for publication in Linear Algebra and its Applications - LAA

Related Organizations

Ponta Grossa State University
Brazil

Keywords

FOS: Computer and information sciences, Quantum Physics, Computer Science - Information Theory, Information Theory (cs.IT), FOS: Physical sciences, Convolutional codes, Quantum coding (general), cyclotomic cosets, negacyclic codes, convolutional codes, Quantum Physics (quant-ph), Cyclic codes

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	28
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%