2000 character limit reached
Information sets from defining sets in abelian codes
Published 10 Jan 2011 in cs.IT and math.IT | (1101.1803v1)
Abstract: We describe a technique to construct a set of check positions (and hence an information set) for every abelian code solely in terms of its defining set. This generalizes that given by Imai in \cite{Imai} in the case of binary TDC codes.
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.