Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Sylvia B. Encheva"'
Autor:
Sylvia B. Encheva
Publikováno v:
SIAM Journal on Discrete Mathematics. 19:145-148
Projective codes with length above the Griesmer bound that satisfy the chain condition are discussed. Necessary and sufficient conditions for binary linear codes for which the chain condition holds are derived.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e444326a6bec5668d9498636de4e81b3
https://doi.org/10.1137/s089548019631431x
https://doi.org/10.1137/s089548019631431x
Publikováno v:
Electronic Notes in Discrete Mathematics. 6:211-219
Let τ be a code of length n. Then x is called a descendant of the coalition of codewords a, b, …, ei fxi ∈ {ai, bi…, ei} for i = 1,…, n. We study codes with the following property: any two non intersecting coalitions of a limited size have n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8eaf4f65ab4cbd290ab021a640b47d71
https://doi.org/10.1016/s1571-0653(04)00172-6
https://doi.org/10.1016/s1571-0653(04)00172-6
Autor:
Sylvia B. Encheva, Gérard D. Cohen
Publikováno v:
Applied Mathematics Letters. 14:177-182
If C is a p-ary code of length n and a(1) and a(2) are two codewords, then a(3) is called a descendant of a(1) and a(2) if ai(3) ∈ {ai(1), ai(2)} for i = 1,…, n. We are interested in codes C with the property that either any two nonintersecting c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b57777fb614b6c74eef4dada931f3b18
https://doi.org/10.1016/s0893-9659(00)00132-4
https://doi.org/10.1016/s0893-9659(00)00132-4
Publikováno v:
Scopus-Elsevier
Let C be a code of length n over an alphabet of q letters. An n-word y is called a descendant of a set of t codewords x1, . . . ,xt if $y_i\in\{x^1_i,\dots,x^t_i\}$ for all i=1, . . . ,n. A code is said to have the t-identifying parent property if fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::11cc548ea0f788cfdeee2b8e4f238dce
https://doi.org/10.1137/s0895480100376848
https://doi.org/10.1137/s0895480100376848
Autor:
Sylvia B. Encheva, Gérard D. Cohen
Publikováno v:
Information Sciences. 126:277-286
The paper studies self-orthogonal codes over GF (3). The state complexities of such codes of lengths ⩽20 with efficient coordinate ordering are found.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2dce6534d935052d3d3686becf40b166
https://doi.org/10.1016/s0020-0255(00)00015-3
https://doi.org/10.1016/s0020-0255(00)00015-3
Autor:
Sylvia B. Encheva, Gérard D. Cohen
Publikováno v:
Applied Mathematics Letters. 13:109-113
Binary linear codes with length at most one above the Griesmer bound were proven to satisfy the chain condition by Helleseth et al. [1]. Binary linear projective codes with length two above the Griesmer bound which satisfy the chain condition are fou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0da04ce316e3069df9c62f8786994823
https://doi.org/10.1016/s0893-9659(99)00219-0
https://doi.org/10.1016/s0893-9659(99)00219-0
Autor:
Sylvia B. Encheva, Gérard D. Cohen
Publikováno v:
Designs, Codes and Cryptography. 20:229-250
A necessary and sufficient condition for a q-ary code to satisfy the two-way chain condition (TCC) is found. A known construction of q-ary codes is shown to yield codes satisfying the TCC. Some q-ary codes of dimension k \leq 6 meeting the Griesmer b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d0361a8c5ed160b24aa9c3c477c4ee8
https://doi.org/10.1023/a:1008369924325
https://doi.org/10.1023/a:1008369924325
Autor:
Sylvia B. Encheva, Gérard D. Cohen
Publikováno v:
Information Sciences. 118:213-222
Binary linear codes with length at most one above the Griesmer bound were proven to satisfy the chain condition by Helleseth et al. [T. Helleseth, T. Klove, O. Ytrehus, IEEE Transactions on Information Theory 38 (1992) 1133–1140]. Binary linear pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::96e60228b7e50e8992f135403ad0c4a5
https://doi.org/10.1016/s0020-0255(99)00036-5
https://doi.org/10.1016/s0020-0255(99)00036-5
Autor:
Gérard D. Cohen, Sylvia B. Encheva
Publikováno v:
IEEE Transactions on Information Theory. 45:1234-1237
New constructions of binary linear intersecting codes are presented. Some codes with high distances are shown to be intersecting.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b7a00d9af7c4ed5d104b18c2fad46458
https://doi.org/10.1109/18.761275
https://doi.org/10.1109/18.761275
Publikováno v:
Designs, Codes and Cryptography. 18:71-80
We show that almost all codes satisfy an antichain condition. This states that the minimum length of a two dimensional subcode of a code C increases if the subcode is constrained to contain a minimum weight codeword. In particular, almost no code sat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4275465773ebad89d7fabf82458220ac
https://doi.org/10.1023/a:1008329017752
https://doi.org/10.1023/a:1008329017752