Extended Cyclic Codes Sandwiched Between Reed-Muller Codes

05/28/2021
by   Changjiang Ji, et al.
0

The famous Barnes-Wall lattices can be obtained by applying Construction D to a chain of Reed-Muller codes. By applying Construction D^(cyc) to a chain of extended cyclic codes sandwiched between Reed-Muller codes, Hu and Nebe (J. London Math. Soc. (2) 101 (2020) 1068-1089) constructed new series of universally strongly perfect lattices sandwiched between Barnes-Wall lattices. In this paper, we explicitly determine the minimum weight codewords of those codes for some special cases.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/22/2019

Skew Constacyclic and LCD Codes over F_q+v F_q

The aim of this paper is to give conditions for the equivalency between ...
research
03/22/2019

Cliques in projective space and construction of Cyclic Grassmannian Codes

The construction of Grassmannian codes in some projective space is of hi...
research
03/14/2023

Structure and Rank of Cyclic codes over a class of non-chain rings

The rings Z_4+ν Z_4 have been classified into chain rings and non-chain ...
research
07/13/2020

Performance Analysis of Identification Codes

In this paper we analyse the construction of identification codes. Ident...
research
12/22/2021

The Grassl-Rötteler cyclic and consta-cyclic MDS codes are generalised Reed-Solomon codes

We prove that the cyclic and constacyclic codes constructed by Grassl an...
research
03/10/2022

Double Constacyclic Codes over Two Finite Commutative Chain Rings

Many kinds of codes which possess two cycle structures over two special ...
research
04/03/2020

A Quadratic Form Approach to Construction A of Lattices over Cyclic Algebras

We propose a construction of lattices from (skew-) polynomial codes, by ...

Please sign up or login with your details

Forgot password? Click here to reset