default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFaina I. Solov'eva
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j40]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
Constructions and Invariants of Optimal Codes in the Lee Metric. Probl. Inf. Transm. 59(2): 71-85 (2023)- 2022
- [j39]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
On Weight Distributions for a Class of Codes with Parameters of Reed-Muller Codes. Probl. Inf. Transm. 58(3): 231-241 (2022) - [j38]Faina I. Solov'eva:
Partitions into Perfect Codes in the Hamming and Lee Metrics. Probl. Inf. Transm. 58(3): 254-264 (2022) - 2021
- [j37]Faina I. Solov'eva:
On Intersections of Reed-Muller Like Codes. Probl. Inf. Transm. 57(4): 357-367 (2021) - [c7]Faina I. Solov'eva:
Quaternary Reed - Muller codes and their minimum weight bases. REDUNDANCY 2021: 166-169 - 2020
- [j36]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
On components of the Kerdock codes and the dual of the BCH code C1, 3. Discret. Math. 343(2): 111668 (2020) - [j35]Ivan Yu. Mogilnykh
, Faina I. Solov'eva:
On existence of perfect bitrades in Hamming graphs. Discret. Math. 343(12): 112128 (2020) - [j34]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
On Bases of BCH Codes with Designed Distance 3 and Their Extensions. Probl. Inf. Transm. 56(4): 309-316 (2020) - [c6]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
Single orbit affine generators for extended BCH codes with designed distance three. ACCT 2020: 1-3 - [i12]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
Coordinate transitivity of extended perfect codes and their SQS. CoRR abs/2009.08191 (2020)
2010 – 2019
- 2019
- [j33]Faina I. Solov'eva, Daniel Augot, Thomas Johansson, Marine Minier, Victor A. Zinoviev:
Editorial: Special issue on coding and cryptography. Des. Codes Cryptogr. 87(2-3): 183-184 (2019) - [i11]Faina I. Solov'eva:
On transitive uniform partitions of F^n into binary Hamming codes. CoRR abs/1904.01282 (2019) - [i10]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
A concatenation construction for propelinear perfect codes from regular subgroups of GA(r, 2). CoRR abs/1905.10005 (2019) - [i9]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
On existence of perfect bitrades in Hamming graphs. CoRR abs/1912.09089 (2019) - 2018
- [j32]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
On explicit minimum weight bases for extended cyclic codes related to Gold functions. Des. Codes Cryptogr. 86(11): 2619-2627 (2018) - [i8]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
On components of a Kerdock code and the dual of the BCH code C1, 3. CoRR abs/1810.04367 (2018) - 2017
- [j31]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
Propelinear codes related to some classes of optimal codes. Probl. Inf. Transm. 53(3): 251-259 (2017) - 2016
- [j30]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
On the symmetry group of the Mollard code. Probl. Inf. Transm. 52(3): 265-275 (2016) - 2015
- [j29]Josep Rifà, Faina I. Solov'eva, Mercè Villanueva:
Erratum to: Intersection of Hamming codes avoiding Hamming subcodes. Des. Codes Cryptogr. 74(1): 283 (2015) - [j28]Josep Rifà, Faina I. Solov'eva, Mercè Villanueva:
Self-embeddings of Hamming Steiner triple systems of small order and APN permutations. Des. Codes Cryptogr. 75(3): 405-427 (2015) - [j27]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
Transitive nonpropelinear perfect codes. Discret. Math. 338(3): 174-182 (2015) - [j26]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
On separability of the classes of homogeneous and transitive perfect binary codes. Probl. Inf. Transm. 51(2): 139-147 (2015) - [i7]Ivan Yu. Mogilnykh, Faina I. Solov'eva:
On maximum components of a class of perfect codes. CoRR abs/1512.03242 (2015) - 2013
- [j25]Joaquim Borges, Ivan Yu. Mogilnykh, Josep Rifà, Faina I. Solov'eva:
On the Number of Nonequivalent Propelinear Extended Perfect Codes. Electron. J. Comb. 20(2): 37 (2013) - [j24]Daniel Augot, Anne Canteaut, Gohar M. Kyureghyan, Faina I. Solov'eva, Øyvind Ytrehus:
Editorial. Des. Codes Cryptogr. 66(1-3): 1-2 (2013) - [c5]Josep Rifà, Faina I. Solov'eva, Mercè Villanueva:
Biembeddings of small order hamming STS(n) and APN monomial power permutations. ISIT 2013: 869-873 - [c4]George K. Guskov, Ivan Yu. Mogilnykh, Faina I. Solov'eva:
Rank spectrum of propelinear perfect binary codes. ISIT 2013: 879-881 - 2012
- [j23]Joaquim Borges, Ivan Yu. Mogilnykh, Josep Rifà, Faina I. Solov'eva:
Structural properties of binary propelinear codes. Adv. Math. Commun. 6(3): 329-346 (2012) - [j22]Josep Rifà, Faina I. Solov'eva, Mercè Villanueva:
Intersection of Hamming codes avoiding Hamming subcodes. Des. Codes Cryptogr. 62(2): 209-223 (2012) - [i6]George K. Guskov, Faina I. Solov'eva:
Properties of perfect transitive binary codes of length 15 and extended perfect transitive binary codes of length 16. CoRR abs/1210.5940 (2012) - [i5]George K. Guskov, Ivan Yu. Mogilnykh, Faina I. Solov'eva:
Ranks of propelinear perfect binary codes. CoRR abs/1210.8253 (2012) - [i4]Josep Rifà, Faina I. Solov'eva, Mercè Villanueva:
Self-embeddings of Hamming Steiner triple systems of small order and APN permutations. CoRR abs/1212.5789 (2012)
2000 – 2009
- 2009
- [j21]Olof Heden, Faina I. Solov'eva:
Partitions of Fn into non-parallel Hamming codes. Adv. Math. Commun. 3(4): 385-397 (2009) - [j20]Faina I. Solov'eva:
On transitive partitions of an n-cube into codes. Probl. Inf. Transm. 45(1): 23-31 (2009) - [j19]Jaume Pujol, Josep Rifà, Faina I. Solov'eva:
Construction of BBZ4-Linear Reed-Muller Codes. IEEE Trans. Inf. Theory 55(1): 99-104 (2009) - [j18]Josep Rifà, Faina I. Solov'eva, Mercè Villanueva:
On the Intersection of BBZ2BBZ4-Additive Hadamard Codes. IEEE Trans. Inf. Theory 55(4): 1766-1774 (2009) - [j17]Ivan Yu. Mogilnykh, Patric R. J. Östergård, Olli Pottonen, Faina I. Solov'eva:
Reconstructing extended perfect binary one-error-correcting codes from their minimum distance graphs. IEEE Trans. Inf. Theory 55(6): 2622-2625 (2009) - 2008
- [j16]Faina I. Solov'eva:
On perfect binary codes. Discret. Appl. Math. 156(9): 1488-1498 (2008) - [j15]Josep Rifà, Faina I. Solov'eva, Mercè Villanueva:
On the Intersection of Z2Z4-Additive Perfect Codes. IEEE Trans. Inf. Theory 54(3): 1346-1356 (2008) - [c3]Rudolf Ahlswede, Faina I. Solov'eva:
A Diametric Theorem in Z nm for Lee and Related Distances. ICMCTA 2008: 1-10 - [i3]Jaume Pujol, Josep Rifà, Faina I. Solov'eva:
Construction of Z4-linear Reed-Muller codes. CoRR abs/0801.3024 (2008) - [i2]Ivan Yu. Mogilnykh, Patric R. J. Östergård, Olli Pottonen, Faina I. Solov'eva:
Reconstructing Extended Perfect Binary One-Error-Correcting Codes from Their Minimum Distance Graphs. CoRR abs/0810.5633 (2008) - 2007
- [j14]Faina I. Solov'eva:
On ℤ4-linear codes with the parameters of Reed-Muller codes. Probl. Inf. Transm. 43(1): 26-32 (2007) - [j13]Faina I. Solov'eva:
Tilings of nonorientable surfaces by Steiner triple systems. Probl. Inf. Transm. 43(3): 213-224 (2007) - [j12]Sergey V. Avgustinovich, Faina I. Solov'eva, Olof Heden:
On partitions of an n-cube into nonequivalent perfect codes. Probl. Inf. Transm. 43(4): 310-315 (2007) - [c2]Jaume Pujol, Josep Rifà, Faina I. Solov'eva:
Quaternary Plotkin Constructions and Quaternary Reed-Muller Codes. AAECC 2007: 148-157 - 2006
- [j11]Sergey V. Avgustinovich, Olof Heden, Faina I. Solov'eva:
On Intersection Problem for Perfect Binary Codes. Des. Codes Cryptogr. 39(3): 317-322 (2006) - [c1]Faina I. Solov'eva:
Designs and Perfect Codes. GTIT-C 2006: 1104-1105 - [i1]Josep Rifà, Faina I. Solov'eva, Mercè Villanueva:
On the intersection of additive perfect codes. CoRR abs/cs/0612015 (2006) - 2005
- [j10]Faina I. Solov'eva:
On perfect binary codes. Electron. Notes Discret. Math. 21: 371-372 (2005) - [j9]Sergey V. Avgustinovich, Faina I. Solov'eva, Olof Heden:
On the Structure of Symmetry Groups of Vasil'ev Codes. Probl. Inf. Transm. 41(2): 105-112 (2005) - [j8]Faina I. Solov'eva:
On the Construction of Transitive Codes. Probl. Inf. Transm. 41(3): 204-211 (2005) - 2004
- [j7]Sergey V. Avgustinovich, Olof Heden, Faina I. Solov'eva:
The Classification of Some Perfect Codes. Des. Codes Cryptogr. 31(3): 313-318 (2004) - 2003
- [j6]Sergey V. Avgustinovich, Faina I. Solov'eva:
To the Metrical Rigidity of Binary Codes. Probl. Inf. Transm. 39(2): 178-183 (2003) - [j5]Sergey V. Avgustinovich, Faina I. Solov'eva, Olof Heden:
On the Ranks and Kernels Problem for Perfect Codes. Probl. Inf. Transm. 39(4): 341-345 (2003) - 2001
- [j4]Faina I. Solov'eva:
Structure of i-components of perfect binary codes. Discret. Appl. Math. 111(1-2): 189-197 (2001) - [j3]Sergey V. Avgustinovich, Faina I. Solov'eva:
On the metrical rigidity of binary codes. Electron. Notes Discret. Math. 6: 444-451 (2001) - [j2]Sergey V. Avgustinovich, Antoine Lobstein, Faina I. Solov'eva:
Intersection matrices for partitions by binary perfect codes. IEEE Trans. Inf. Theory 47(4): 1621-1624 (2001) - 2000
- [j1]Faina I. Solov'eva:
Perfect binary codes: bounds and properties. Discret. Math. 213(1-3): 283-290 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
