AI Chat AI Image Generator AI Video Text to Speech

On the Arithmetic Complexities of Hamming Codes and Hadamard Codes

04/26/2018

∙

by Zhengrui Li, et al.

∙

∙

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.

Zhengrui Li
2 publications
Sian-Jheng Lin
8 publications
Honggang Hu
7 publications

page 1

page 2

page 3

page 4

research

∙ 12/14/2021

Relative generalized Hamming weights of evaluation codes

The aim of this work is to algebraically describe the relative generaliz...

0 Delio Jaramillo-Velez, et al. ∙

research

∙ 09/08/2023

Bridging Hamming Distance Spectrum with Coset Cardinality Spectrum for Overlapped Arithmetic Codes

Overlapped arithmetic codes, featured by overlapped intervals, are a var...

0 Yong Fang, et al. ∙

research

∙ 05/31/2023

A Hamming-Like Bound for Degenerate Stabilizer Codes

The quantum Hamming bound was originally put forward as an upper bound o...

0 Andrew Nemec, et al. ∙

research

∙ 04/02/2019

On transitive uniform partitions of F^n into binary Hamming codes

We investigate transitive uniform partitions of the vector space F^n of ...

0 Faina I. Solov'eva, et al. ∙

research

∙ 05/24/2022

On the number of error correcting codes

We show that for a fixed q, the number of q-ary t-error correcting codes...

0 Dingding Dong, et al. ∙

research

∙ 06/14/2019

Complexity of Dependencies in Bounded Domains, Armstrong Codes, and Generalizations

The study of Armstrong codes is motivated by the problem of understandin...

0 Yeow Meng Chee, et al. ∙

research

∙ 07/12/2021

Primitive Rateless Codes

In this paper, we propose primitive rateless (PR) codes. A PR code is ch...

0 Mahyar Shirvanimoghaddam, et al. ∙