Zobrazeno 1 - 10
of 1 113
pro vyhledávání: '"Hamming bound"'
Autor:
Pedro-José Cazorla García
Publikováno v:
Mathematics, Vol 12, Iss 11, p 1642 (2024)
Perfect error-correcting codes allow for an optimal transmission of information while guaranteeing error correction. For this reason, proving their existence has been a classical problem in both pure mathematics and information theory. Indeed, the cl
Externí odkaz:
https://doaj.org/article/0cc4ec46201745b3b05003853091693b
Publikováno v:
IEEE Access, Vol 8, Pp 227894-227900 (2020)
In this paper, we present a computer-supported method of searching for quantum caps. By means of this method and relevant knowledge of combinatorics, many quantum caps in $PG(3,9)$ and $PG(4,9)$ are constructively proven to exist. Then, according to
Externí odkaz:
https://doaj.org/article/2be5a012770849d18ad7602498066e02
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Tuvi Etzion
Publikováno v:
IEEE Transactions on Information Theory. 68:891-904
Diameter perfect codes form a natural generalization for perfect codes. They are based on the code-anticode bound which generalizes the sphere-packing bound. The code-anticode bound was proved by Delsarte for distance-regular graphs and it holds for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6ba310a7d477f661122d15844c5c929
https://doi.org/10.1109/tit.2021.3125277
https://doi.org/10.1109/tit.2021.3125277
Publikováno v:
Cryptography and Communications. 14:663-675
For positive integers k ≥ 2 and t, let m = 2kt and α be a primitive element of the finite field $\mathbb {F}_{2^{m}}$ . In this paper, we study the parameters of a class of cyclic codes $\mathcal {C}_{(1,v)}$ which has two zeros α and αv with $v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c3e572913184f481059f323aa43534d9
https://doi.org/10.1007/s12095-021-00548-1
https://doi.org/10.1007/s12095-021-00548-1
Publikováno v:
Designs, Codes and Cryptography. 89:2511-2531
In the rank modulation scheme for flash memories, permutation codes have been studied. In this paper, we study perfect permutation codes in $$S_n$$ , the set of all permutations on n elements, under the Kendall $$\tau $$ -metric. We answer one open p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c4b52a1e8a19e453a0ce0cc3cff00a8d
https://doi.org/10.1007/s10623-021-00934-z
https://doi.org/10.1007/s10623-021-00934-z
Autor:
Daniel Rohweder, Robert F. H. Fischer, Sebastian Stern, Sergo Shavgulidze, Juergen Freudenberger
Publikováno v:
IEEE Transactions on Communications. 69:5079-5090
The Hurwitz lattice provides the densest four-dimensional packing. This fact has motivated research on four-dimensional Hurwitz signal constellations for optical and wireless communications. This work presents a new algebraic construction of finite s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cef34792b243b0f614094ff898d7c9d9
https://doi.org/10.1109/tcomm.2021.3083323
https://doi.org/10.1109/tcomm.2021.3083323
Autor:
Nikita Valentinovich Egorov
Publikováno v:
Globus. 7:16-19
This article presents an analytical review of noise-tolerant codes, namely, the perfect codes are considered. Ideal codes can be used to encode and decode information, as they have all the desired properties, namely, resistance to interference and ea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fb3ff08f1a3acc3d4d41714f4766770a
https://doi.org/10.52013/2658-5197-61-4-5
https://doi.org/10.52013/2658-5197-61-4-5
Autor:
Ralf R. Muller
Publikováno v:
IEEE Transactions on Communications. 69:2987-2996
This paper presents a method to calculate the exact average block error probability of some random code ensembles under maximum-likelihood decoding. The proposed method is applicable to various channels and ensembles. The focus is on both spherical a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::264e2f9997e01651bf74f4c7fde81689
https://doi.org/10.1109/tcomm.2021.3052539
https://doi.org/10.1109/tcomm.2021.3052539