scholarly journals Weight distributions for projective binary linear codes from Weil sums

2021 ◽  
Vol 6 (8) ◽  
pp. 8600-8610
Author(s):  
Shudi Yang ◽  
◽  
Zheng-An Yao ◽  
10.37236/414 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
Joshua Brown Kramer

Ahlswede, Aydinian, and Khachatrian posed the following problem: what is the maximum number of Hamming weight $w$ vectors in a $k$-dimensional subspace of $\mathbb{F}_2^n$? The answer to this question could be relevant to coding theory, since it sheds light on the weight distributions of binary linear codes. We give some partial results. We also provide a conjecture for the complete solution when $w$ is odd as well as for the case $k \geq 2w$ and $w$ even. One tool used to study this problem is a linear map that decreases the weight of nonzero vectors by a constant. We characterize such maps.


Author(s):  
Jia Liu ◽  
Mingyu Zhang ◽  
Rongjun Chen ◽  
Chaoyong Wang ◽  
Xiaofeng An ◽  
...  

1999 ◽  
Vol 45 (6) ◽  
pp. 2136-2137 ◽  
Author(s):  
D.B. Jaffe ◽  
J. Simonis

Author(s):  
Xiaoqiang Wang ◽  
Dabin Zheng ◽  
Hongwei Liu

Sign in / Sign up

Export Citation Format

Share Document