[PDF][PDF] The sizes of optimal q-ary codes of weight three and distance four: a complete solution
PubTeX output 2008.02.12:1112 Page 1 IEEE TRANSACTIONS ON INFORMATION THEORY,
VOL. 54, NO. 3, MARCH 2008 1291 for coding. For example, for any integer i 0 and for any real …
VOL. 54, NO. 3, MARCH 2008 1291 for coding. For example, for any integer i 0 and for any real …
On perfect q-ary codes in the maximum metric
C Qureshi, SIR Costa - 2016 Information Theory and …, 2016 - ieeexplore.ieee.org
Perfect codes in a given metric are the ones which attain the sphere packing bound. In the
Hamming metric perfect linear codes over finite fields are known only to exist for a restricted …
Hamming metric perfect linear codes over finite fields are known only to exist for a restricted …
Hanani triple packings and optimal -ary codes of constant weight three
The exact sizes of optimal q q-ary codes of length nn, constant weight ww and distance d=
2w-1 d= 2 w-1 have only been determined for q ∈ {2, 3\} q∈ 2, 3, and for w|(q-1) nw|(q-1) n …
2w-1 d= 2 w-1 have only been determined for q ∈ {2, 3\} q∈ 2, 3, and for w|(q-1) nw|(q-1) n …
Maximal-nary linear codes with large minimum distance (Corresp.)
A Patel - IEEE Transactions on Information Theory, 1975 - ieeexplore.ieee.org
This correspondence presents a complete solution to the problem of constructing maximal q-
nary codes, for any word length n and minimum distance d in the region qd ≧ (q-1) n …
nary codes, for any word length n and minimum distance d in the region qd ≧ (q-1) n …
Ranks of q-Ary 1-Perfect Codes
KT Phelps, M Villanueva - Designs, Codes and Cryptography, 2002 - Springer
The rank of aq-ary code C of length n, r (C), isthe dimension of the subspace spanned by C.
We establish the existence of q-ary 1-perfectcodes of length n= q^ m-1 q-1 for m≥ 4 and r …
We establish the existence of q-ary 1-perfectcodes of length n= q^ m-1 q-1 for m≥ 4 and r …
On q-ary Codes with Two Distances d and d + 1
P Boyvalenkov, K Delchev, DV Zinoviev… - Problems of Information …, 2020 - Springer
We consider q-ary block codes with exactly two distances: d and d+ 1. Several constructions
of such codes are given. In the linear case, we show that all codes can be obtained by a …
of such codes are given. In the linear case, we show that all codes can be obtained by a …
Lower bounds for q-ary codes of covering radius one
W Haas - Discrete Mathematics, 2000 - Elsevier
Let kq (n) denote the minimal cardinality of a q-ary code C of length n and covering radius
one. The numbers of elements of C that lie in a fixed k-dimensional subspace of {0,…, q− 1} …
one. The numbers of elements of C that lie in a fixed k-dimensional subspace of {0,…, q− 1} …
Minimum Block Length of a Linear -ary Code with Specified Dimension and Code Distance
SM Dodunekov - Problemy Peredachi Informatsii, 1984 - mathnet.ru
The article considers the determination of the minimum possible length of a linear code with
specified dimension and code distance over a field of $ q $ elements. Constructions of …
specified dimension and code distance over a field of $ q $ elements. Constructions of …
[PDF][PDF] Codes with two distances: d and d+ 1
P Boyvalenkov, K Delchev, DV Zinoviev… - Proc. 16th Int …, 2018 - researchgate.net
Codes with two distances: d and d +1 Page 1 Codes with two distances: d and d +1 P.
Boyvalenkov1, K. Delchev1, DV Zinoviev2 and VA Zinoviev2∗†‡ Abstract The q-ary block …
Boyvalenkov1, K. Delchev1, DV Zinoviev2 and VA Zinoviev2∗†‡ Abstract The q-ary block …
[PDF][PDF] New examples in coding theory for construction optimal linear codes related with weight distribution
AM Khalaf, NYK Yahya - AIP Conference Proceedings, 2023 - researchgate.net
Page 1 View Online Export Citation CrossMark RESEARCH ARTICLE | SEPTEMBER
13 2023 New examples in coding theory for construction optimal linear codes related with …
13 2023 New examples in coding theory for construction optimal linear codes related with …