On optimal linear codes of dimension 4

In coding theory, the problem of finding the shortest linear codes for a fixed set of parameters is central. Given the dimension $k$, the minimum weight $d$, and the order $q$ of the finite field $\bF_q$ over which the code is defined, the function $n_q(k, d)$ specifies the smallest length $n$ for...

Full description

Bibliographic Details
Main Authors: Nanami Bono, Maya Fujii, Tatsuya Maruta
Format: Article
Language:English
Published: Yildiz Technical University 2021-05-01
Series:Journal of Algebra Combinatorics Discrete Structures and Applications
Subjects:
Online Access:https://jacodesmath.com/index.php/jacodesmath/article/view/119

Similar Items