Tsonka Stefanova Baicheva

Probl. Inf. Transm., September, 2024

Some Comments About CRC Selection for the 5G NR Specification.

[BibT_eX]

[DOI]

Peter Kazakov

IEEE Access, 2024

2022

On the diffusion of the Improved Generalized Feistel.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2022

2021

Hybrid Constructions of Binary Sequences With Low Autocorrelation Sideobes.

[BibT_eX]

[DOI]

Nikolay Nikolov

IEEE Access, 2021

2020

Efficient Generation of Low Autocorrelation Binary Sequences.

[BibT_eX]

[DOI]

Nikolay Nikolov

IEEE Signal Process. Lett., 2020

On the Generation of Long Binary Sequences With Record-Breaking PSL Values.

[BibT_eX]

[DOI]

Nikolay Nikolov

IEEE Signal Process. Lett., 2020

2019

Classification of optimal (v, k, 1) binary cyclically permutable constant weight codes with $$k=5, $$ k = 5 , 6 and 7 and small lengths.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2019

On the Diffusion Property of the Improved Generalized Feistel with Different Permutations for Each Round.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Informatics - 8th International Conference, 2019

CRC selection for decoding of CRC-polar concatenated codes.

[BibT_eX]

[DOI]

Peter Kazakov

Proceedings of the 9th Balkan Conference on Informatics, 2019

2018

Classification of Strongly Conflict-Avoiding Codes.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2018

2017

Optimal conflict-avoiding codes for 3, 4 and 5 active users.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2017

Classification of optimal conflict-avoiding codes of weights 6 and 7.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

2013

Optimal (v, 5, 2, 1) optical orthogonal codes of small v.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2013

2011

Classification of optimal (v, 4, 1) binary cyclically permutable constant-weight codes and cyclic 2-(v, 4, 1) designs with v ≤ 76.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2011

All binary linear codes of lengths up to 18 or redundancy up to 10 are normal.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2011

2010

On the least covering radius of binary linear codes of dimension 6.

[BibT_eX]

[DOI]

Iliya Bouyukliev

Adv. Math. Commun., 2010

2009

Linear Codes of Good Error Control Performance.

[BibT_eX]

[DOI]

Proceedings of the Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes, 2009

2008

Binary and Ternary Linear Quasi-Perfect Codes With Small Dimensions.

[BibT_eX]

[DOI]

Iliya Bouyukliev

Stefan M. Dodunekov

Veerle Fack

IEEE Trans. Inf. Theory, 2008

Determination of the Best CRC Codes with up to 10-Bit Redundancy.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2008

2003

On the least covering radius of binary linear codes with small lengths.

[BibT_eX]

[DOI]

Vesselin Vavrek

IEEE Trans. Inf. Theory, 2003

2002

On the performance of the ternary [13, 7, 5] quadratic-residue code.

[BibT_eX]

[DOI]

Stefan M. Dodunekov

Ralf Koetter

IEEE Trans. Inf. Theory, 2002

2001

On the covering radius of ternary negacyclic codes with length up to 26.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

1999

Optimal Binary One-Error-Correcting Codes of Length 10 Have 72 Codewords.

[BibT_eX]

[DOI]

Patric R. J. Östergård

Emil Kolev

IEEE Trans. Inf. Theory, 1999

1998

Correction to 'Covering Radii of Ternary Linear Codes of Small Dimensions and Codimensions'.

[BibT_eX]

[DOI]

Evgenia D. Velikova

IEEE Trans. Inf. Theory, 1998

The Covering Radius of Ternary Cyclic Codes with Length up to 25.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 1998

On the cyclic redundancy-check codes with 8-bit redundancy.

[BibT_eX]

[DOI]

Stefan M. Dodunekov

Peter Kazakov

Comput. Commun., 1998

1997

Covering radii of ternary linear codes of small dimensions and codimensions.

[BibT_eX]

[DOI]