V. M. Sidel'nikov

From MaRDI portal
Revision as of 07:38, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:881135

Available identifiers

zbMath Open sidelnikov.vladimir-mMaRDI QIDQ881135

List of research outcomes

PublicationDate of PublicationType
Algebraic aspects of key generation systems2018-04-26Paper
A MacWilliams relation for group association schemes2018-01-24Paper
https://portal.mardi4nfdi.de/entity/Q34501052015-11-02Paper
On the construction of \((w,r)\) cover-free codes2009-10-20Paper
A new method for constructing key agreement schemes2009-01-19Paper
https://portal.mardi4nfdi.de/entity/Q54454062008-03-05Paper
Association schemes and metrics on finite groups2007-06-27Paper
On the automorphism group of a Suzuki \(p\)-algebra.2007-05-21Paper
https://portal.mardi4nfdi.de/entity/Q34178612007-01-31Paper
Matrix groups related to the quaternion group and spherical orbit codes2006-05-29Paper
https://portal.mardi4nfdi.de/entity/Q46647022005-04-08Paper
MacWilliams relations for spherical orbit codes.2004-06-15Paper
On a class of quantum codes.2004-06-15Paper
Relative Duality in MacWilliams Identity2003-09-16Paper
On the spectrum of orbit codes in the space of matrices2003-09-04Paper
Quantum codes and Abelian subgroups of the extra-special group2002-01-01Paper
Algorithms for generation of a common key using a quantum communication channel2001-11-22Paper
On a finite matrix group and orbit codes on Euclidean spheres2001-01-28Paper
https://portal.mardi4nfdi.de/entity/Q44881122000-07-09Paper
Spherical 7-designs in \(2^n\)-dimensional Euclidean space2000-06-21Paper
https://portal.mardi4nfdi.de/entity/Q42264032000-03-13Paper
Key distribution systems based on exponential representations of linear groups \(GL_n(\mathbb{F}_p)\)1999-12-02Paper
On some arithmetical properties of orbit codes in a space of matrices1999-03-15Paper
https://portal.mardi4nfdi.de/entity/Q38387181998-11-05Paper
On a finite matrix group and codes over a Euclidean sphere1998-07-15Paper
Decoding Reed-Solomon codes beyond \((d-1)/2\) and zeros of multivariate polynomials1995-09-17Paper
A public-key cryptosystem based on binary Reed-Muller codes1995-05-22Paper
https://portal.mardi4nfdi.de/entity/Q43281151995-04-24Paper
https://portal.mardi4nfdi.de/entity/Q43215301995-02-19Paper
https://portal.mardi4nfdi.de/entity/Q43159991995-01-31Paper
On the edge-independence number and edge-covering number for regular graphs1994-09-07Paper
Entropy of some binary sources1994-03-08Paper
Decoding of Reed-Muller codes with a large number of errors1993-06-29Paper
Estimates for the number of appearances of symbols on a segment of recurrent sequence over a finite field1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q33635981991-01-01Paper
Codes associated with the linear fractional group1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47351401989-01-01Paper
ON NORMAL BASES OF A FINITE FIELD1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37658781987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37956121987-01-01Paper
Linear ternary quasiperfect codes correcting double errors1986-01-01Paper
Extremal polynomials used in bounds of code volume1980-01-01Paper
NEW BOUNDS FOR DENSEST PACKING OF SPHERES INn-DIMENSIONAL EUCLIDEAN SPACE1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40661731974-01-01Paper
Upper bounds on the cardinality of a binary code with a given minimum distance1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40481681973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40444291971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56525311971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56525321971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40489421969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56705601966-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: V. M. Sidel'nikov