pith. sign in

arxiv: 1502.02489 · v1 · pith:QCH523WEnew · submitted 2015-02-09 · 💻 cs.IT · math.IT

Fourier Codes and Hartley Codes

classification 💻 cs.IT math.IT
keywords codesblocktransformscomputeddensitydiscretefourierhartley
0
0 comments X
read the original abstract

Real-valued block codes are introduced, which are derived from Discrete Fourier Transforms (DFT) and Discrete Hartley Transforms (DHT). These algebraic structures are built from the eigensequences of the transforms. Generator and parity check matrices were computed for codes up to block length N=24. They can be viewed as lattices codes so the main parameters (dimension, minimal norm, area of the Voronoi region, density, and centre density) are computed. Particularly, Hamming-Hartley and Golay-Hartley block codes are presented. These codes may possibly help an efficient computation of a DHT/DFT.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.