AbstractWe find the Hamming weight distribution of some classes of linear codes. The cyclic codes in these classes have composite parity-check polynomials
AbstractWe study the weight distribution of the linear codes over GF(ql) which have generator matric...
AbstractLet dq(n,k) be the maximum possible minimum Hamming distance of a linear [n,k] code over Fq....
This paper is about weight distribution of a code and zeta polynomials. Some computations and exampl...
AbstractWe find the Hamming weight distribution of some classes of linear codes. The cyclic codes in...
AbstractWe construct an infinite sequence of codes with related parity-check matrices. We show how t...
Determining the weight distribution of a code is an old and fundamental topic in coding theory that ...
AbstractWe study the weight distribution of irreducible cyclic (n, k) codeswith block lengths n = n1...
Let h1(x)h2(x) be the parity check polynomial of a binary cyclic code. This article presents a formu...
One of the most important research areas in coding theory is weight enumeration. This is a large sub...
Recent results of the author on linear recurring sequences are used to obtain estimates for the weig...
With any fixed prime number p and positive integer N, not divisible by p, there is associated an inf...
In this paper we obtain formulas for the number of codewords of each weight in several classes of su...
Let $\mathbb{F}_q$ be a finite field with $q$ elements and $n$ be a positive integer. In this paper,...
Many research in coding theory is focussed on linear error-correcting codes. Since these codes are s...
AbstractA MacWilliams identity for complete weight enumerators of codes over Mn×s(Fq) endowed with a...
AbstractWe study the weight distribution of the linear codes over GF(ql) which have generator matric...
AbstractLet dq(n,k) be the maximum possible minimum Hamming distance of a linear [n,k] code over Fq....
This paper is about weight distribution of a code and zeta polynomials. Some computations and exampl...
AbstractWe find the Hamming weight distribution of some classes of linear codes. The cyclic codes in...
AbstractWe construct an infinite sequence of codes with related parity-check matrices. We show how t...
Determining the weight distribution of a code is an old and fundamental topic in coding theory that ...
AbstractWe study the weight distribution of irreducible cyclic (n, k) codeswith block lengths n = n1...
Let h1(x)h2(x) be the parity check polynomial of a binary cyclic code. This article presents a formu...
One of the most important research areas in coding theory is weight enumeration. This is a large sub...
Recent results of the author on linear recurring sequences are used to obtain estimates for the weig...
With any fixed prime number p and positive integer N, not divisible by p, there is associated an inf...
In this paper we obtain formulas for the number of codewords of each weight in several classes of su...
Let $\mathbb{F}_q$ be a finite field with $q$ elements and $n$ be a positive integer. In this paper,...
Many research in coding theory is focussed on linear error-correcting codes. Since these codes are s...
AbstractA MacWilliams identity for complete weight enumerators of codes over Mn×s(Fq) endowed with a...
AbstractWe study the weight distribution of the linear codes over GF(ql) which have generator matric...
AbstractLet dq(n,k) be the maximum possible minimum Hamming distance of a linear [n,k] code over Fq....
This paper is about weight distribution of a code and zeta polynomials. Some computations and exampl...
DOI
Add to ORKG