2000 character limit reached
On the Griesmer Bound for Systematic Codes
Published 15 Oct 2013 in cs.IT and math.IT | (1310.4060v1)
Abstract: We generalize the Griesmer bound in the case of systematic codes over a field of size q greater than the distance d of the code. We also generalize the Griesmer bound in the case of any systematic code of distance 2,3,4 and in the case of binary systematic codes of distance up to 6.
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.