On Negacyclic MDS-Convolutional Codes
classification
🪐 quant-ph
cs.ITmath.IT
keywords
classicalcodesnegacyclicquantumalgebraicallyattainboundcomputational
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.