TH3.R7.3

Upper bounds on the rate of linear q-ary k-hash codes

Stefano Della Fiore, University of Salerno, Italy; Marco Dalai, University of Brescia, Italy
Session:
Algebraic Aspects of Coding Theory 1
Track:
1: Algebraic Aspects of Coding Theory
Location:
VIP
Presentation Time:
Thu, 11 Jul, 15:15 - 15:35
Session Chair:
Vitaly Skachek, University of Tartu
Abstract
This paper presents upper bounds on the rate of linear $k$-hash codes in $\mathbb{F}_q^n$, $q\geq k$, that is, codes with the property that any $k$ distinct codewords are all simultaneously distinct in at least one coordinate.
Session TH3.R7
TH3.R7.1: Nested Construction of $\mathbb{Z}_{2^L}$-Linear Codes
Gustavo Terra Bastos, Federal University of São João del-Rei, Brazil; Maiara Francine Bollauf, Simula UiB, Norway; Agnaldo José Ferrari, São Paulo State University, Brazil; Øyvind Ytrehus, Simula UiB, Norway
TH3.R7.2: Efficient Root-Finding for Interpolation-Based Decoding of Elliptic and Hyperelliptic Codes
Jianguo Zhao, Jiwei Liang, Li Chen, Sun Yat-sen University, China
TH3.R7.3: Upper bounds on the rate of linear q-ary k-hash codes
Stefano Della Fiore, University of Salerno, Italy; Marco Dalai, University of Brescia, Italy
TH3.R7.4: Weighted-Hamming Metric for Parallel Channels
Sebastian Bitzer, Technical University of Munich, Germany; Alberto Ravagnani, Eindhoven University of Technology, Netherlands; Violetta Weger, Technical University of Munich, Germany
Resources
View Manuscript