English
Related papers

Related papers: The Weight Distributions of Two Classes of Linear …

200 papers

We construct strongly walk-regular graphs as coset graphs of the duals of codes with three non-zero homogeneous weights over $\mathbb{Z}_{p^m},$ for $p$ a prime, and more generally over chain rings of depth $m$, and with a residue field of…

Combinatorics · Mathematics 2019-12-10 Michael Kiermaier , Sascha Kurz , Minjia Shi , Patrick Solé

The Walsh transform $\widehat{Q}$ of a quadratic function $Q:F_{p^n}\rightarrow F_p$ satisfies $|\widehat{Q}(b)| \in \{0,p^{\frac{n+s}{2}}\}$ for all $b\in F_{p^n}$, where $0\le s\le n-1$ is an integer depending on $Q$. In this article, we…

Number Theory · Mathematics 2016-03-16 Nurdagül Anbar , Wilfried Meidl , Alev Topuzoglu

In this article, we study the properties of a class of functional spaces which arise from the investigation of nonlinear differential equations. We establish some integral inequalities then by applying these inequalities, we prove some…

Functional Analysis · Mathematics 2023-10-11 Kamal N. Soltanov , Ugur Sert

In this paper, we completely determine the number of solutions to $ \operatorname{Tr}^{q^2}_q(bx+b)+c=0, x\in \mu_{q+1}\backslash \{-1\}$ for all $b\in \mathbb{F}_{q^2}, c\in\mathbb{F}_{q}$. As an application, we can give the weight…

Information Theory · Computer Science 2023-04-11 Wei Lu , Xia Wu

In this paper, we determine the complete weight distribution of the space $ \mathbb{F}_q^N $ endowed by the weighted coordinates poset block metric ($(P,w,\pi)$-metric), also known as the $(P,w,\pi)$-space, thereby obtaining it for…

Information Theory · Computer Science 2025-01-22 Atul Kumar Shriwastva , R. S. Selvaraj

Asymptotic concentration behaviors of linear combinations of weight distributions on the random linear code ensemble are presented. Many important properties of a binary linear code can be expressed as the form of a linear combination of…

Information Theory · Computer Science 2008-03-10 Tadashi Wadayama

In this paper non-trivial non-linear binary systematic AMDS codes are classified in terms of their weight distributions, employing only elementary techniques. In particular, we show that their length and minimum distance completely…

Information Theory · Computer Science 2013-09-04 Alberto Ravagnani

Three classes of binary linear codes with at most four nonzero weights were constructed in this paper, in which two of them are projective three-weight codes. As applications, $s$-sum sets for any odd $ s > 1$ were constructed.

Information Theory · Computer Science 2025-08-26 Tonghui Zhang , Pinhui Ke , Zuling Chang

The average weight distribution of a regular low-density parity-check (LDPC) code ensemble over a finite field is thoroughly analyzed. In particular, a precise asymptotic approximation of the average weight distribution is derived for the…

Information Theory · Computer Science 2015-03-17 Shengtian Yang , Thomas Honold , Yan Chen , Zhaoyang Zhang , Peiliang Qiu

In this paper, we investigate completely decomposable rank-metric codes, i.e. rank-metric codes that are the direct sum of 1-dimensional maximum rank distance codes. We study the weight distribution of such codes, characterizing codewords…

Information Theory · Computer Science 2024-06-28 Paolo Santonastaso

The generalized Hamming weight of linear codes is a natural generalization of the minimum Hamming distance. They convey the structural information of a linear code and determine its performance in various applications, and have become one…

Information Theory · Computer Science 2022-12-08 Chao Liu , Dabin Zheng , Xiaoqiang Wang

In this paper, we derive the average weight distributions for the irregular non-binary cluster low-density parity-check (LDPC) code ensembles. Moreover, we give the exponential growth rate of the average weight distribution in the limit of…

Information Theory · Computer Science 2015-06-15 Takayuki Nozaki , Masaki Maehara , Kenta Kasai , Kohichi Sakaniwa

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

Let $p$ be an odd prime number. We prove that for $m\equiv1\mod p$, $x^m$ is perfectly nonlinear over $\mathbb{F}_{p^n}$ for infinitely many $n$ if and only if $m$ is of the form $p^l+1$, $l\in\mathbb{N}$. First, we study singularities of…

Number Theory · Mathematics 2012-05-04 Elodie Leducq

We introduce the class of partition-balanced families of codes, and show how to exploit their combinatorial invariants to obtain upper and lower bounds on the number of codes that have a prescribed property. In particular, we derive precise…

Information Theory · Computer Science 2018-12-13 Eimear Byrne , Alberto Ravagnani

We investigate the weight distribution of random binary linear codes. For $0<\lambda<1$ and $n\to\infty$ pick uniformly at random $\lambda n$ vectors in $\mathbb{F}_2^n$ and let $C \le \mathbb{F}_2^n$ be the orthogonal complement of their…

Information Theory · Computer Science 2024-07-11 Nati Linial , Jonathan Mosheiff

We study on finite unramified extensions of global function fields (function fields of one valuable over a finite field). We show two results. One is an extension of Perret's result about the ideal class group problem. Another is a…

Number Theory · Mathematics 2010-10-27 Tsuyoshi Itoh

Linear codes with few weights have applications in authentication codes, secrete sharing schemes, association schemes, consumer electronics and data storage system. In this paper, several classes of linear codes with two or three weights…

Information Theory · Computer Science 2020-07-23 Guangkui Xu , Xiwang Cao

We derive a recursive formula determing the weight distribution of the [n=(q^m-1)/(q-1), n-m, 3] Hamming code H(m,q), when (m, q-1)=1. Here q is a prime power. The proof is based on Moisio's idea of using Pless power moment identity…

Information Theory · Computer Science 2007-10-09 Dae San Kim

Boolean functions with good cryptographic criteria when restricted to the set of vectors with constant Hamming weight play an important role in the recent FLIP stream cipher. In this paper, we propose a large class of weightwise perfectly…

Cryptography and Security · Computer Science 2017-09-12 Jian Liu , Sihem Mesnager
‹ Prev 1 8 9 10 Next ›