Zobrazeno 1 - 10 of 46 pro vyhledávání: '"Faina I. Solov'eva"'
1
On Bases of BCH Codes with Designed Distance 3 and Their Extensions
Autor: I. Yu. Mogilnykh, Faina I. Solov'eva
Publikováno v: Problems of Information Transmission. 56:309-316
We consider narrow-sense BCH codes of length pm − 1 over $${{\mathbb{F}}}_{p}$$ , m ≥ 3. We prove that neither such a code with designed distance δ = 3 nor its extension for p ≥ 5 is generated by the set of its codewords of the minimum nonzero
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::60fb9382b5eb205248808c98ba1c1d1c
https://doi.org/10.1134/s003294602004002x
Zobrazit plný text záznamu
5
On transitive uniform partitions of $F^n$ into binary Hamming codes
Autor: Faina I. Solov'eva
Publikováno v: Sibirskie Elektronnye Matematicheskie Izvestiya. 16:886-892
We investigate transitive uniform partitions of the vector space $F^n$ of dimension $n$ over the Galois field $GF(2)$ into cosets of Hamming codes. A partition $P^n= \{H_0,H_1+e_1,\ldots,H_n+e_n\}$ of $F^n$ into cosets of Hamming codes $H_0,H_1,\ldot
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9e2af23cf15c03acba1bdc85978044a6
https://doi.org/10.33048/semi.2019.16.058
Zobrazit plný text záznamu
6
Self-embeddings of Hamming Steiner triple systems of small order and APN permutations
Autor: Faina I. Solov'eva, Josep Rifà, Mercè Villanueva
Publikováno v: Recercat: Dipósit de la Recerca de Catalunya
Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
Dipòsit Digital de Documents de la UAB
Universitat Autònoma de Barcelona
Recercat. Dipósit de la Recerca de Catalunya
instname
The classification, up to isomorphism, of all self-embedding monomial power permutations of Hamming Steiner triple systems of order n=2^m-1 for small m, m < 23, is given. As far as we know, for m in {5,7,11,13,17,19}, all given self-embeddings in clo
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::92d0d7cee7fa6e0532febb664b56600e
http://hdl.handle.net/2072/407957
Zobrazit plný text záznamu
7
Single orbit affine generators for extended BCH codes with designed distance three
Autor: Ivan Yu. Mogilnykh, Faina I. Solov'eva
Publikováno v: ACCT
We show that for any prime p, p ≠ 2, 3 and any m, m ≥ 3 the narrow-sense BCH codes over GF (p) of length pm − 1 with designed distance three are not spanned by theirs minimum nonzero weight codewords. We prove that the extensions of these codes
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::e23fd9050cf64e44fba1eaccee0d58d0
https://doi.org/10.1109/acct51235.2020.9383376
Zobrazit plný text záznamu
8
On explicit minimum weight bases for extended cyclic codes related to Gold functions
Autor: Faina I. Solov'eva, I. Yu. Mogilnykh
Publikováno v: Designs, Codes and Cryptography. 86:2619-2627
Minimum weight bases of some extended cyclic codes can be chosen from the affine orbits of certain explicitly represented minimum weight codewords. We find such bases for the following three classes of codes: the extended primitive 2-error correcting
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::2117c2d5ec59129d533a484dfd4470a1
https://doi.org/10.1007/s10623-018-0464-7
Zobrazit plný text záznamu
9
Propelinear codes related to some classes of optimal codes
Autor: I. Yu. Mogilnykh, Faina I. Solov'eva
Publikováno v: Problems of Information Transmission. 53:251-259
A code is said to be propelinear if its automorphism group contains a subgroup that acts regularly on codewords. We show propelinearity of complements of cyclic codes C 1,i , (i, 2 m − 1) = 1, of length n = 2 m − 1, including the primitive two-er
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::2d89df2558cda2a421769fe6384c2e08
https://doi.org/10.1134/s0032946017030061
Zobrazit plný text záznamu
10
On the symmetry group of the Mollard code
Autor: Faina I. Solov'eva, I. Yu. Mogilnykh
Publikováno v: Problems of Information Transmission. 52:265-275
We study the symmetry group of a binary perfect Mollard code M(C,D) of length tm + t + m containing as its subcodes the codes C1 and D2 formed from perfect codes C and D of lengths t and m, respectively, by adding an appropriate number of zeros. For
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::105c9684d28fa01ce9594862c325b0a7
https://doi.org/10.1134/s0032946016030042
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje