2000 character limit reached
On the Exact Lower Bounds of Encoding Circuit Sizes of Hamming Codes and Hadamard Codes
Published 26 Apr 2018 in cs.IT and math.IT | (1804.09903v2)
Abstract: In this paper, we investigate the encoding circuit size of Hamming codes and Hadamard codes. To begin with, we prove the exact lower bound of circuit size required in the encoding of (punctured)~Hadamard codes and (extended)~Hamming codes. Then the encoding algorithms for (punctured)~Hadamard codes are presented to achieve the derived lower bounds. For (extended)~Hamming codes, we also propose encoding algorithms that achieve the lower bounds.
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.