Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Stefan Dodunekov"'
Publikováno v:
Designs, Codes and Cryptography. 75:315-334
In this paper a general class of linear cyclic codes $$C_{n,q,t}^i , 1\le i\le t$$ C n , q , t i , 1 ≤ i ≤ t , is defined of length $$n$$ n and over a field $${ GF}(q)$$ G F ( q ) with $$(n,q)=1$$ ( n , q ) = 1 . This class of codes includes as s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8318219cec6ca25d765b473b53fc1fed
https://doi.org/10.1007/s10623-013-9905-5
https://doi.org/10.1007/s10623-013-9905-5
Publikováno v:
IEEE Transactions on Information Theory. 54:4335-4339
The aim of this work is a systematic investigation of the possible parameters of quasi-perfect (QP) binary and ternary linear codes of small dimensions and preparing a complete classification of all such codes. First we give a list of infinite famili
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::252e09fa0a0bd92c567d07dcd54766e2
https://doi.org/10.1109/tit.2008.928277
https://doi.org/10.1109/tit.2008.928277
Autor:
Danyo Danev, Stefan Dodunekov
Publikováno v:
Designs, Codes and Cryptography. 49:265-271
In this paper we present a family of ternary quasi-perfect BCH codes. These codes are of minimum distance 5 and covering radius 3. The first member of this family is the ternary quadratic-residue code of length 13.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e7221f1aa90704c7a1aa66daf8ad2b68
https://doi.org/10.1007/s10623-008-9193-7
https://doi.org/10.1007/s10623-008-9193-7
Publikováno v:
IEEE Transactions on Information Theory. 50:311-318
In this paper, we present some results concerning a decomposition of binary self-dual codes having an automorphism of an order which is the product of two odd prime numbers. These results are applied to construct self-dual [72,36,12] codes with an au
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e38b581364e22bd841dd5692d9e76949
https://doi.org/10.1109/tit.2003.822598
https://doi.org/10.1109/tit.2003.822598
Publikováno v:
Computer Communications. 21:1030-1033
Polynomials of degree eight over GF(2) which are suitable to be used as generator polynomials for cyclic redundancy-check (CRC) codes are investigated. Their minimum distance, properness and undetected error probability for binary symmetric channels
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::230fe27be94bd5e8b5bef0e772bd238d
https://doi.org/10.1016/s0140-3664(98)00165-0
https://doi.org/10.1016/s0140-3664(98)00165-0
Publikováno v:
Designs, Codes and Cryptography. 4:57-67
Recently Jungnickel and Tonchev have shown that there exist at least four inequivalent binary selfcomplementary [28, 7, 12] codes and have asked if there are other [28, 7] codes with weight distributionA0=A28=1,A12=A16=63. In the present paper we giv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9cc2f8fc3d87a937c7fa493271aff251
https://doi.org/10.1007/bf01388560
https://doi.org/10.1007/bf01388560
Publikováno v:
EUROPEAN JOURNAL OF COMBINATORICS
In this paper, we show that a set of q+a hyperplanes, q>13, a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6ab1a63fa43b5c67809bb2973ffed3c
https://biblio.vub.ac.be/vubir/partial-covers-of-pgnq(9b0963a4-c4fa-46e2-b311-d74765ada33b).html
https://biblio.vub.ac.be/vubir/partial-covers-of-pgnq(9b0963a4-c4fa-46e2-b311-d74765ada33b).html
In this paper a family of constacyclic ternary quasi-perfect linear block codes is presented. This family extends the result presented in a previous work by the first two authors, where the existence of codes with the presented parameters was stated
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ddcf46a745e2a5644867bb52da4e4df0
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-21897
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-21897
Autor:
Juriaan Simonis, Stefan Dodunekov
Publikováno v:
Numbers, Information and Complexity ISBN: 9781441949677
The goal of this paper is to present an overview on known constructions of length-optimal linear codes. First we discuss the interrelation between various definitions of optimality in terms of the basic parameters of a linear code: length, dimension
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::41a97a476416732e21b78d36c79978bd
https://doi.org/10.1007/978-1-4757-6048-4_21
https://doi.org/10.1007/978-1-4757-6048-4_21
Autor:
Stefan Dodunekov, Juriaan Simonis
Publikováno v:
The Electronic Journal of Combinatorics, 5, 1-23. Electronic Journal of Combinatorics
The paper gives a matrix-free presentation of the correspondence between full-length linear codes and projective multisets. It generalizes the Brouwer-Van Eupen construction that transforms projective codes into two-weight codes. Short proofs of know
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::13de0e870d0f5e354a81a626d71484f4
https://doi.org/10.37236/1375
https://doi.org/10.37236/1375