English
Related papers

Related papers: Characteristic vector and weight distribution of a…

200 papers

We quantify precisely the distribution of the output of a binary random number generator (RNG) after conditioning with a binary linear code generator matrix by showing the connection between the Walsh spectrum of the resulting random…

Information Theory · Computer Science 2018-06-08 Alessandro Tomasi , Alessio Meneghetti , Massimiliano Sala

Recently, linear codes with few weights have been widely studied, since they have applications in data storage systems, communication systems and consumer electronics. In this paper, we present a class of three-weight and five-weight linear…

Information Theory · Computer Science 2015-09-22 Fei Li , Qiuyan Wang , Dongdai Lin

In this expository paper we show how one can, in a uniform way, calculate the weight distributions of some well-known binary cyclic codes. The codes are related to certain families of curves, and the weight distributions are related to the…

Number Theory · Mathematics 2016-09-06 René Schoof

Studying the generalized Hamming weights of linear codes is a significant research area within coding theory, as it provides valuable structural information about the codes and plays a crucial role in determining their performance in…

Information Theory · Computer Science 2024-05-31 Wei Lu , Qingyao Wang , Xiaoqiang Wang , Dabin Zheng

Statistical query (SQ) algorithms are algorithms that have access to an {\em SQ oracle} for the input distribution $D$ instead of i.i.d.~ samples from $D$. Given a query function $\phi:X \rightarrow [-1,1]$, the oracle returns an estimate…

Machine Learning · Computer Science 2017-04-18 Vitaly Feldman

Detailed information about the weight distribution of a convolutional code is given by the adjacency matrix of the state diagram associated with a controller canonical form of the code. We will show that this matrix is an invariant of the…

Information Theory · Computer Science 2007-07-13 Heide Gluesing-Luerssen

In the present paper we introduce and study finite point subsets of a special kind, called optimum distributions, in the n-dimensional unit cube. Such distributions are closely related with known (delta,s,n)-nets of low discrepancy. It…

Combinatorics · Mathematics 2007-07-16 M. M. Skriganov

We study the combinatorial function $L(k,q),$ the maximum number of nonzero weights a linear code of dimension $k$ over $\F_q$ can have. We determine it completely for $q=2,$ and for $k=2,$ and provide upper and lower bounds in the general…

Information Theory · Computer Science 2018-04-26 Minjia Shi , Hongwei Zhu , Patrick Solé , Gérard D. Cohen

In this article we present a class of codes with few weights arising from special type of linear sets. We explicitly show the weights of such codes, their weight enumerator and possible choices for their generator matrices. In particular,…

Combinatorics · Mathematics 2020-05-07 Vito Napolitano , Ferdinando Zullo

Firstly, we give a formula on the generalized Hamming weight of linear codes constructed generically by defining sets. Secondly, by choosing properly the defining set we obtain a class of cyclotomic linear codes and then present two…

Information Theory · Computer Science 2022-06-17 Fei Li

Linear codes can be employed to construct authentication codes, which is an interesting area of cryptography. The parameters of the authentication codes depend on the complete weight enumerator of the underlying linear codes. In order to…

Information Theory · Computer Science 2015-05-27 Can Xiang , Hao Liu

A codeword is associated to a linearized polynomial. The weight distribution of the codewords is determined as the linearized polynomial varies in a family of fixed degree. There is a corresponding result on Wenger graphs from linearized…

Information Theory · Computer Science 2015-02-17 Haode Yan , Chunlei Liu

A linear $ [n,k]_q $ code $ C $ is said to be a full weight spectrum (FWS) code if there exist codewords of each nonzero weight less than or equal to $ n $. In this brief communication we determine necessary and sufficient conditions for…

Information Theory · Computer Science 2022-07-18 Tim L. Alderson

We consider the problem of determining the weights of a quantum ensemble. That is to say, given a quantum system that is in a set of possible known states according to an unknown probability law, we give strategies to estimate the…

Quantum Physics · Physics 2010-02-01 J. I. de Vicente , J. Calsamiglia , R. Munoz-Tapia , E. Bagan

In the recent work \cite{shi18}, a combinatorial problem concerning linear codes over a finite field $\F_q$ was introduced. In that work the authors studied the weight set of an $[n,k]_q$ linear code, that is the set of non-zero distinct…

Information Theory · Computer Science 2022-07-18 Tim L. Alderson , Alessandro Neri

The quantum propagator and characteristic equation in the presence of a chain of $\delta$-potentials are obtained in the rectangular, cylindrical and spherical coordinate systems. The simplicity and efficiency of the method is illustrated…

Quantum Physics · Physics 2017-01-03 A. Refaei , F. Kheirandish

The weight distribution and weight hierarchy of a linear code are two important research topics in coding theory. In this paper, choosing $ D=\Big\{(x,y)\in \Big(\F_{p^{s_1}}\times\F_{p^{s_2}}\Big)\Big\backslash\{(0,0)\}:…

Information Theory · Computer Science 2023-05-22 Shupeng Hu , Fei Li , Xiumei Li

In this paper, based on the theory of defining sets, two classes of five-weight or six-weight linear codes over Fp are constructed. The weight distributions of the linear codes are determined by means of Weil sums and a new type of…

Information Theory · Computer Science 2021-04-09 Xina Zhang

Linear codes with few weights have applications in consumer electronics, communication, data storage system, secret sharing, authentication codes, association schemes, and strongly regular graphs. This paper first generalizes the method of…

Information Theory · Computer Science 2015-08-17 Chunming Tang , Nian Li , Yanfeng Qi , Zhengchun Zhou , Tor Helleseth

We consider linear codes over a finite field of odd characteristic, derived from determinantal varieties, obtained from symmetric matrices of bounded ranks. A formula for the weight of a code word is derived. Using this formula, we have…

Information Theory · Computer Science 2023-12-25 Peter Beelen , Trygve Johnsen , Prasant Singh