2000 character limit reached
Twisted Reed-Solomon Codes
Published 5 Jan 2017 in cs.IT and math.IT | (1701.01295v2)
Abstract: We present a new general construction of MDS codes over a finite field . We describe two explicit subclasses which contain new MDS codes of length at least for all values of . Moreover, we show that most of the new codes are not equivalent to a Reed-Solomon code.
Paper Prompts
Sign up for free to create and run prompts on this paper.