2000 character limit reached
On Negacyclic MDS-Convolutional Codes
Published 11 Oct 2013 in quant-ph, cs.IT, and math.IT | (1310.3265v4)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.