An explicit formula for a weight enumerator of linear-congruence codes

08/28/2018
by   Taro Sakurai, et al.
0

An explicit formula for a weight enumerator of linear-congruence codes is provided. This extends the work of Bibak and Milenkovic [IEEE ISIT (2018) 431-435] addressing the binary case to the non-binary case. Furthermore, the extension simplifies their proof and provides a complete solution to a problem posed by them.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/24/2020

Weight distributions and weight hierarchies of two classes of binary linear codes

First, we present a formula for computing the weight hierarchies of line...
research
12/31/2021

Quaternary linear codes and related binary subfield codes

In this paper, we mainly study quaternary linear codes and their binary ...
research
10/12/2020

Unweighted linear congruences with distinct coordinates and the Varshamov–Tenengolts codes

In this paper, we first give explicit formulas for the number of solutio...
research
04/24/2019

CLT for non-Hermitian random band matrices with variance profiles

We show that the fluctuations of the linear eigenvalue statistics of a n...
research
12/09/2020

Complete weight enumerators of a class of linear codes with four or five weights

In this paper, based on the theory of defining sets, a class of four-wei...
research
01/16/2020

Weight Enumerators for Number-Theoretic Codes and Cardinalities of Non-binary VT Codes

This paper investigates the extended weight enumerators for the number-t...
research
12/23/2018

Explicit Formulas for the Weight Enumerators of Some Classes of Deletion Correcting Codes

We introduce a general class of codes which includes several well-known ...

Please sign up or login with your details

Forgot password? Click here to reset