Technical Program

Paper Detail

Paper IDT.1.1
Paper Title On the Exact Lower Bounds of Encoding Circuit Sizes of Hamming Codes and Hadamard Codes
Authors Zhengrui Li, Sian-Jheng Lin, University of Science and Technology of China~(USTC), China; Yunghsiang S. Han, Dongguan University of Technology, China
Session T.1: Complexity and Computation Theory
Presentation Lecture
Track Topics in Information Theory
Manuscript  Click here to download the manuscript
Virtual Presentation  Click here to watch in the Virtual Symposium
Abstract In this paper, we investigate the encoding circuit size of Hamming codes and Hadamard codes. To begin with, we prove lower bounds of encoding circuit size required in the encoding of (punctured)~Hadamard codes and (extended)~Hamming codes. Then the encoding algorithms for (extended)~Hamming codes are presented to achieve the derived lower bounds.

Plan Ahead


2021 IEEE International Symposium on Information Theory

11-16 July 2021 | Melbourne, Victoria, Australia

Visit Website!