On the Computation of the Weight Distribution of Linear Codes over Finite Fields

09/19/2018
by   Iliya Bouyukliev, et al.
0

We develop an algorithm for computing the weight distribution of a linear [n,k] code over a finite field F_q. We represent the codes by their characteristic vector with respect to a given generator matrix and a special type of a generator matrix of the k-dimensional simplex code. This characteristic vector is the input data of our algorithms. The complexity of the presented algorithms is O(kq^k).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/28/2019

Hulls of Linear Codes Revisited with Applications

Hulls of linear codes have been of interest and extensively studied due ...
research
06/06/2018

Binary linear code weight distribution estimation by random bit stream compression

A statistical estimation algorithm of the weight distribution of a linea...
research
04/15/2021

Approximate and discrete Euclidean vector bundles

We introduce ε-approximate versions of the notion of Euclidean vector bu...
research
04/29/2020

Support Constrained Generator Matrices of Gabidulin Codes in Characteristic Zero

Gabidulin codes over fields of characteristic zero were recently constru...
research
09/17/2018

Faster individual discrete logarithms in finite fields of composite extension degree

Computing discrete logarithms in finite fields is a main concern in cryp...
research
01/15/2019

Linear Network Coding: Effects of Varying the Message Dimension on the Set of Characteristics

It is known a vector linear solution may exist if and only if the charac...
research
03/27/2019

Characteristic-Dependent Linear Rank Inequalities via Complementary Vector Spaces

A characteristic-dependent linear rank inequality is a linear inequality...

Please sign up or login with your details

Forgot password? Click here to reset