Anais De XXXVI Simpósio Brasileiro De Telecomunicações E Processamento De Sinais 2018
DOI: 10.14209/sbrt.2018.1
|View full text |Cite
|
Sign up to set email alerts
|

The Hamming and Golay Number-Theoretic Transforms

Abstract: New number-theoretic transforms are derived from known linear block codes over finite fields. In particular, two new such transforms are built from perfect codes, namely the Hamming number-theoretic transform and the Golay numbertheoretic transform. A few properties of these new transforms are presented.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
6
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(6 citation statements)
references
References 12 publications
0
6
0
Order By: Relevance
“…The special case p = 2 and N = 7 is suitably linked to the Hamming NTT [17]. Based on the binary Hamming code H (7,4,3), we get the 7 × 7 binary Hamming NTT, whose transformation matrix is [18]…”
Section: Geometrical Representation Of Binary Sequencesmentioning
confidence: 99%
See 1 more Smart Citation
“…The special case p = 2 and N = 7 is suitably linked to the Hamming NTT [17]. Based on the binary Hamming code H (7,4,3), we get the 7 × 7 binary Hamming NTT, whose transformation matrix is [18]…”
Section: Geometrical Representation Of Binary Sequencesmentioning
confidence: 99%
“…Based on the Fourier NTT and the Hartley NTT, the Fourier and Hartley codes were introduced [3,7]. Conversely, popular error-correcting codes [13], such as the Hamming [9] and Golay codes [14], inspired the introduction of the Hamming number-theoretic transform (HamNTT) [17] and the Golay number-theoretic transform (GNTT) [17] which extend the theory introduced in [4,18]. In fact, an isomorphism between linear codes and transforms was identified in [17].…”
Section: Introductionmentioning
confidence: 99%
“…The special case p = 2 and N = 7 is suitably linked to the Hamming NTT [16]. Based on the binary Hamming code H(7, 4, 3), we get the 7 × 7 binary Hamming NTT, whose transformation matrix is [18]…”
Section: Geometrical Representation Of Binary Sequencesmentioning
confidence: 99%
“…Thus the Golay NTT requires only additions in order to be computed and it is applicable to any sequence of the {GF(3)} 12 -space. Illustrative examples of the effect of the Golay numbertheoretic transform [16] on ternary vectors of length 12 are shown in Figures 5 and 6. Note that complex symbols are always vertices of one of the two dodecagons.…”
Section: Geometrical Representation Of the Ternary Golay Transformmentioning
confidence: 99%
See 1 more Smart Citation