Zobrazeno 1 - 10
of 513
pro vyhledávání: '"Ternary Golay code"'
Autor:
Vladimir D. Tonchev
Publikováno v:
Designs, Codes and Cryptography. 90:2753-2762
It is proved that a code $L(q)$ which is monomially equivalent to the Pless symmetry code $C(q)$ of length $2q+2$ contains the (0,1)-incidence matrix of a Hadamard 3-$(2q+2,q+1,(q-1)/2)$ design $D(q)$ associated with a Paley-Hadamard matrix of type I
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c3a46f68becd94f1b1cd6c0beca15f0f
https://doi.org/10.1007/s10623-021-00941-0
https://doi.org/10.1007/s10623-021-00941-0
Publikováno v:
IEEE Transactions on Information Theory. 67:4239-4254
Motivated by the duplication-correcting problem for data storage in live DNA, we study the construction of constant-weight codes in $\ell _{1}$ -metric. By using packings and group divisible designs in combinatorial design theory, we give constructio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e50f25956b4f8aba8f427616e34b0fd5
https://doi.org/10.1109/tit.2021.3052191
https://doi.org/10.1109/tit.2021.3052191
Autor:
D.V. Efanov
Publikováno v:
Izvestiâ vysših učebnyh zavedenij. Priborostroenie. 64:433-443
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1c00b7e4c09d0db6c9dae5a206e10325
https://doi.org/10.17586/0021-3454-2021-64-6-433-443
https://doi.org/10.17586/0021-3454-2021-64-6-433-443
Publikováno v:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :650-655
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ad7ed14b90f35b17ae017347f93c0c6c
https://doi.org/10.1587/transfun.2020eal2079
https://doi.org/10.1587/transfun.2020eal2079
Autor:
Chunming Tang, Cunsheng Ding
Publikováno v:
IEEE Transactions on Information Theory. 66:5419-5428
An $[{n}, {k}, {n}-{k}+1]$ linear code is called an MDS code. An $[{n}, {k}, {n}-{k}]$ linear code is said to be almost maximum distance separable (almost MDS or AMDS for short). A code is said to be near maximum distance separable (near MDS or NMDS
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::441aaff49deaf5175f4ed11f290ea2d6
https://doi.org/10.1109/tit.2020.2990396
https://doi.org/10.1109/tit.2020.2990396
Autor:
D.V. Efanov
Publikováno v:
Izvestiâ vysših učebnyh zavedenij. Priborostroenie. :391-404
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::241ec22c1c282a90d6820855105274cb
https://doi.org/10.17586/0021-3454-2020-63-5-391-404
https://doi.org/10.17586/0021-3454-2020-63-5-391-404
Autor:
Simon Eisenbarth, Gabriele Nebe
Publikováno v:
Mathematics in Computer Science. 14:443-456
In this paper, we study self-dual codes over commutative Artinian chain rings. Let R be such a ring, x be a generator of the unique maximal ideal of R and $$a\in {\mathbb {N}}_0 $$ maximal such that $$x^a\ne 0$$. A code C over R of length t is an R-s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::67bac80e3c32b7c023673a5f571acc95
https://doi.org/10.1007/s11786-019-00429-0
https://doi.org/10.1007/s11786-019-00429-0
Publikováno v:
Izvestiya Instituta Matematiki i Informatiki. Udmurt. Gos. Univ.. 53:115-126
This paper discusses the possibility of list decoding of wavelet codes and states that wavelet codes over the field $GF(q)$ of an odd characteristic with the length of the code and information words $n=q-1$ and ${n}/{2} $, respectively, as well as ov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4143497957cc3ddc40b7de8431bad529
https://doi.org/10.20537/2226-3594-2019-53-10
https://doi.org/10.20537/2226-3594-2019-53-10
Publikováno v:
BlackSeaCom
In this paper, we consider the problem of designing uniquely decodable (UD) ternary code sets for low-density spreading code-division multiple-access (LDS-CDMA) systems. The proposed code set provides unique decodability for a number of users K that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d76e3d2fd1ac3b8744eb9c549a67143c
https://doi.org/10.1109/blackseacom52164.2021.9527898
https://doi.org/10.1109/blackseacom52164.2021.9527898
Autor:
Košek, Michal
The goal of this thesis is to present a description of a highly transitive group M12 in two different ways and a comparison of these methods. First of them is a reproduction of a construction of M12 in the context of shuffle groups. We use this oppor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2186::9b4f9db126715d7f7aee3519e9324230
http://www.nusl.cz/ntk/nusl-451069
http://www.nusl.cz/ntk/nusl-451069
