How many weights can a linear code have?

02/01/2018
by   Minjia Shi, et al.
0

We study the combinatorial function L(k,q), the maximum number of nonzero weights a linear code of dimension k over _q can have. We determine it completely for q=2, and for k=2, and provide upper and lower bounds in the general case when both k and q are > 3. A refinement L(n,k,q), as well as nonlinear analogues N(M,q) and N(n,M,q), are also introduced and studied.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/23/2018

The largest number of weights in cyclic codes

Upper and lower bounds on the largest number of weights in a cyclic code...
research
04/12/2018

On linear codes and distinct weights

We provide a construction for linear codes attaining the maximum possibl...
research
07/16/2022

MWS and FWS Codes for Coordinate-Wise Weight Functions

A combinatorial problem concerning the maximum size of the (hamming) wei...
research
05/27/2022

ℤ_pℤ_p^2-linear codes: rank and kernel

A code C is called _p_p^2-linear if it is the Gray image of a _p_p^2-add...
research
03/26/2021

Lower Bounds on the Generalization Error of Nonlinear Learning Models

We study in this paper lower bounds for the generalization error of mode...
research
08/18/2021

Improved Lower Bounds for Secure Codes and Related Structures

Secure codes are widely-studied combinatorial structures which were intr...
research
03/15/2012

Negative Tree Reweighted Belief Propagation

We introduce a new class of lower bounds on the log partition function o...

Please sign up or login with your details

Forgot password? Click here to reset