Zobrazeno 1 - 10
of 55
pro vyhledávání: '"Stefan Dodunekov"'
Publikováno v:
Biomath, Vol 1, Iss 2 (2012)
The President of the Bulgarian Academy of Sciences Stefan Dodunekov passed away on August 5, 2012, after a short illness at the age of 66. Stefan Dodunekov was a distinguished expert the field of coding theory. . . .
Externí odkaz:
https://doaj.org/article/49a915859b7b4442b35c8ab1635efb98
Autor:
Blagovest Sendov
Publikováno v:
Biomath, Vol 1, Iss 2 (2012)
Dear mournful family and all present, We are here to bow and to send to his eternal rest the President of the Bulgarian Academy of Sciences—Academician Stefan Manev Dodunekov. We have come to share together the enormous loss every one of us has su
Externí odkaz:
https://doaj.org/article/0a2e32a01cbf4abeb4bb3e760f1aaa69
Publikováno v:
Digital Presentation and Preservation of Cultural and Scientific Heritage. (II):9-9
Externí odkaz:
https://www.ceeol.com/search/article-detail?id=173586
Publikováno v:
Biomath. Dec2012, p1-1. 1p.
Publikováno v:
Biomath. Dec2012, p1-2. 2p.
Publikováno v:
ACM Communications in Computer Algebra; January 2013, Vol. 46 Issue: 4 p70-71, 2p
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
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
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.
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