|
This article is cited in 3 scientific papers (total in 3 papers)
Discrete mathematics and mathematical cybernetics
Minimum weight bases for quaternary Reed – Muller codes
F. I. Solov'eva Sobolev Institute of Mathematics, 4, Acad. Koptyuga ave., Novosibirsk, 630090, Russia
Abstract:
The quaternary Plotkin and BQ-Plotkin constructions giving the families of quaternary Reed – Muller codes were presented in 2009. The Gray map image of the obtained $\mathbb{Z}_4$-linear codes have the same parameters and fundamental properties as the codes in the classical binary linear Reed – Muller family. We have found one more general property for the families of quaternary Reed – Muller codes that is common with binary Reed – Muller codes: all these quaternary codes have bases of minimum weight codewords. The bases are constructed by induction.
Keywords:
Reed – Muller code, quaternary code, additive code, quaternary Reed – Muller code, minimum weight basis, $\mathbb{Z}_4$-linear code.
Received December 12, 2020, published November 24, 2021
Citation:
F. I. Solov'eva, “Minimum weight bases for quaternary Reed – Muller codes”, Sib. Èlektron. Mat. Izv., 18:2 (2021), 1358–1366
Linking options:
https://www.mathnet.ru/eng/semr1444 https://www.mathnet.ru/eng/semr/v18/i2/p1358
|
Statistics & downloads: |
Abstract page: | 88 | Full-text PDF : | 38 | References: | 28 |
|