Name
Abstract | ||
|---|---|---|
In this paper, we study the arithmetic complexities of Hamming codes and Hadamard codes. To begin with, we present the minimum number of required exclusive-ORs~(XORs) in the encoding of (punctured)~Hadamard codes and (extended)~Hamming codes. Then the encoding algorithms for these codes are presented to achieve the lower bound. |
Year | Venue | Field |
|---|---|---|
2018 | arXiv: Information Theory | Hamming code,Discrete mathematics,Encoding algorithm,Upper and lower bounds,Arithmetic,Hadamard transform,Mathematics,Encoding (memory) |
DocType | Volume | Citations |
Journal | abs/1804.09903 | 0 |
PageRank | References | Authors |
0.34 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhengrui Li | 1 | 0 | 0.34 |
| Sian-Jheng Lin | 2 | 0 | 0.68 |
| Honggang Hu | 3 | 15 | 5.92 |