Peter G. Boyvalenkov

Discret. Math., May, 2023

2022

On Codes with Distances d and n.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2022

Bounds for the Minimum Distance and Covering Radius of Orthogonal Arrays Via Their Distance Distributions.

[BibT_eX]

[DOI]

Proceedings of the 10th International Workshop on Signal Design and Its Applications in Communications, 2022

2021

Universal Bounds for Size and Energy of Codes of Given Minimum and Maximum Distances.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Bounds for spherical codes: The Levenshtein framework lifted.

[BibT_eX]

[DOI]

Math. Comput., 2021

On two-weight codes.

[BibT_eX]

[DOI]

Discret. Math., 2021

Upper Energy Bounds for Spherical Designs of Relatively Small Cardinalities.

[BibT_eX]

[DOI]

Konstantin Delchev

Matthieu Jourdain

Discret. Comput. Geom., 2021

On spherical 4-distance 7-designs.

[BibT_eX]

[DOI]

Navid Safaei

Proceedings of the XVII International Symposium "Problems of Redundancy in Information and Control Systems", 2021

2020

On q-ary Codes with Two Distances d and d + 1.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2020

Upper bounds for energies of spherical codes of given cardinality and separation.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2020

Classification of Moduli Sets for Residue Number System With Special Diagonal Functions.

[BibT_eX]

[DOI]

Pavel Alekseevich Lyakhov

Nikolay I. Chervyakov

IEEE Access, 2020

On two-weight (linear and nonlinear) codes.

[BibT_eX]

[DOI]

Proceedings of the Algebraic and Combinatorial Coding Theory, 2020

New lower and upper bounds on Armstrong codes.

[BibT_eX]

[DOI]

Todorka Alexandrova

Attila Sali

Proceedings of the Algebraic and Combinatorial Coding Theory, 2020

2019

On spherical codes with inner products in a prescribed interval.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2019

On q-ary codes with two distances d and d+1.

[BibT_eX]

[DOI]

CoRR, 2019

Linear Programming Bounds.

[BibT_eX]

[DOI]

CoRR, 2019

On Two Problems Concerning Universal Bounds for Codes.

[BibT_eX]

[DOI]

Proceedings of the XVI International Symposium "Problems of Redundancy in Information and Control Systems", 2019

Linear Programming Bounds for Cardinality and Energy of Codes of Given Min and Max Distances.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Refinements of Levenshtein Bounds in q-ary Hamming Spaces.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2018

Refinements of Levenshtein bounds in q-ary Hamming spaces.

[BibT_eX]

[DOI]

CoRR, 2018

Optimisation Techniques in Wildfire Simulations. Test Case Kresna Fire August 2017.

[BibT_eX]

[DOI]

Nina Dobrinkova

Momchil Panayotov

Proceedings of the Numerical Methods and Applications - 9th International Conference, 2018

2017

On a Linear Cryptanalysis of a Family of Modified DES Ciphers with Even Weight S-boxes.

[BibT_eX]

[DOI]

Yuri L. Borissov

Robert Tsenkov

IACR Cryptol. ePrint Arch., 2017

Universal Lower Bounds on Energy and LP-Extremal Polynomials for (4, 24)-Codes.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

On maximal antipodal spherical codes with few distances.

[BibT_eX]

[DOI]

Konstantin Delchev

Electron. Notes Discret. Math., 2017

Energy bounds for codes and designs in Hamming spaces.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2017

Nonexistence of a few binary orthogonal arrays.

[BibT_eX]

[DOI]

Tanya Marinova

Discret. Appl. Math., 2017

2015

Nonexistence of binary orthogonal arrays via their distance distributions.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2015

Linear Cryptanalysis and Modified DES with Embedded Parity Check in the S-boxes.

[BibT_eX]

[DOI]

Yuri L. Borissov

Robert Tsenkov

Proceedings of the Cryptography and Information Security in the Balkans, 2015

2013

Investigation of binary orthogonal arrays via their distance distributions.

[BibT_eX]

[DOI]

Hristina N. Kulina

Probl. Inf. Transm., 2013

New nonexistence results for spherical designs.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2013

2010

A new asymptotic bound of the minimum possible odd cardinality of spherical (2k-1)-designs.

[BibT_eX]

[DOI]

Discret. Math., 2010

2009

A method for proving nonexistence of spherical designs of odd strength and odd cardinality.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2009

Polynomial techniques for investigation of spherical designs.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2009

1999

Necessary Conditions for Existence of Some Designs in Polynomial Metric Spaces.

[BibT_eX]

[DOI]

Eur. J. Comb., 1999

Nonexistence of Certain Spherical Designs of Odd Strengths and Cardinalities.

[BibT_eX]

[DOI]

Svetla Nikova

Discret. Comput. Geom., 1999

Indexes of spherical codes.

[BibT_eX]

[DOI]

Peter Kazakov

Proceedings of the Codes and Association Schemes, 1999

1997

On Maximal Codes in Polynominal Metric Spaces.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1997

1996

Upper bounds on the minimum distance of spherical codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1996

1995

Extremal Polynomials for Obtaining Bounds for Spherical Codes and Designs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1995

On Maximal Spherical Codes I.

[BibT_eX]

[DOI]

Ivan N. Landgev

Proceedings of the Applied Algebra, 1995

1993

Nonexistence of Certain Symmetrical Spherical Codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 1993

New lower bounds for some spherical designs.

[BibT_eX]

[DOI]