Magazine et Edition

Volume 22 (2022): Edition 3 (September 2022)

Volume 22 (2022): Edition 2 (June 2022)

Volume 22 (2022): Edition 1 (March 2022)

Volume 21 (2021): Edition 4 (December 2021)

Volume 21 (2021): Edition 3 (September 2021)

Volume 21 (2021): Edition 2 (June 2021)

Volume 21 (2021): Edition 1 (March 2021)

Volume 20 (2020): Edition 6 (December 2020)
Special Edition on New Developments in Scalable Computing

Volume 20 (2020): Edition 5 (December 2020)
Special issue on Innovations in Intelligent Systems and Applications

Volume 20 (2020): Edition 4 (November 2020)

Volume 20 (2020): Edition 3 (September 2020)

Volume 20 (2020): Edition 2 (June 2020)

Volume 20 (2020): Edition 1 (March 2020)

Volume 19 (2019): Edition 4 (November 2019)

Volume 19 (2019): Edition 3 (September 2019)

Volume 19 (2019): Edition 2 (June 2019)

Volume 19 (2019): Edition 1 (March 2019)

Volume 18 (2018): Edition 5 (May 2018)
Special Thematic Edition on Optimal Codes and Related Topics

Volume 18 (2018): Edition 4 (November 2018)

Volume 18 (2018): Edition 3 (September 2018)

Volume 18 (2018): Edition 2 (June 2018)

Volume 18 (2018): Edition 1 (March 2018)

Volume 17 (2017): Edition 5 (December 2017)
Special Edition With Selected Papers From The Workshop “Two Years Avitohol: Advanced High Performance Computing Applications 2017

Volume 17 (2017): Edition 4 (November 2017)

Volume 17 (2017): Edition 3 (September 2017)

Volume 17 (2017): Edition 2 (June 2017)

Volume 17 (2017): Edition 1 (March 2017)

Volume 16 (2016): Edition 6 (December 2016)
Special issue with selection of extended papers from 6th International Conference on Logistic, Informatics and Service Science LISS’2016

Volume 16 (2016): Edition 5 (October 2016)
Edition Title: Special Edition on Application of Advanced Computing and Simulation in Information Systems

Volume 16 (2016): Edition 4 (December 2016)

Volume 16 (2016): Edition 3 (September 2016)

Volume 16 (2016): Edition 2 (June 2016)

Volume 16 (2016): Edition 1 (March 2016)

Volume 15 (2015): Edition 7 (December 2015)
Special Edition on Information Fusion

Volume 15 (2015): Edition 6 (December 2015)
Special Edition on Logistics, Informatics and Service Science

Volume 15 (2015): Edition 5 (April 2015)
Special Edition on Control in Transportation Systems

Volume 15 (2015): Edition 4 (November 2015)

Volume 15 (2015): Edition 3 (September 2015)

Volume 15 (2015): Edition 2 (June 2015)

Volume 15 (2015): Edition 1 (March 2015)

Volume 14 (2014): Edition 5 (December 2014)
Special Edition

Volume 14 (2014): Edition 4 (December 2014)

Volume 14 (2014): Edition 3 (September 2014)

Volume 14 (2014): Edition 2 (June 2014)

Volume 14 (2014): Edition 1 (March 2014)

Volume 13 (2013): Edition Special-Edition (December 2013)

Volume 13 (2013): Edition 4 (December 2013)
The publishing of the present issue (Volume 13, No 4, 2013) of the journal “Cybernetics and Information Technologies” is financially supported by FP7 project “Advanced Computing for Innovation” (ACOMIN), grant agreement 316087 of Call FP7 REGPOT-2012-2013-1.

Volume 13 (2013): Edition 3 (September 2013)

Volume 13 (2013): Edition 2 (June 2013)

Volume 13 (2013): Edition 1 (March 2013)

Volume 12 (2012): Edition 4 (December 2012)

Volume 12 (2012): Edition 3 (September 2012)

Volume 12 (2012): Edition 2 (June 2012)

Volume 12 (2012): Edition 1 (March 2012)

Détails du magazine
Format
Magazine
eISSN
1314-4081
Première publication
13 Mar 2012
Période de publication
4 fois par an
Langues
Anglais

Chercher

Volume 18 (2018): Edition 5 (May 2018)
Special Thematic Edition on Optimal Codes and Related Topics

Détails du magazine
Format
Magazine
eISSN
1314-4081
Première publication
13 Mar 2012
Période de publication
4 fois par an
Langues
Anglais

Chercher

9 Articles
Accès libre

Preface

Publié en ligne: 26 May 2018
Pages: 3 - 3

Résumé

Abstract

This volume contains selected papers from the Eighth International Workshop on Optimal Codes and Related Topics (OCRT’2017) organized as minisymposium during the conference Mathematical days in Sofia (10-14 July 2017). This workshop was organized by the Institute of Mathematics and Informatics of the Bulgarian Academy of Sciences. There were 37 participants and 26 contributed talks.

Accès libre

On Tight Optimal Conflict-Avoiding Codes for 3, 4, 5 and 6 Active Users

Publié en ligne: 26 May 2018
Pages: 5 - 11

Résumé

Abstract

We classify tight optimal conflict-avoiding codes of weights 3, 4, 5 and 6 and given small lengths.

Mots clés

  • Conflict-avoiding codes
  • tight optimal codes
  • protocol sequences
Accès libre

Software Approaches and Methods to Ensure the Security of Interactive Systems

Publié en ligne: 26 May 2018
Pages: 12 - 20

Résumé

Abstract

In the paper are studied methods for protection of interactive systems and digital archives against unauthorized distribution of digital content. We make an overview of steganographic methods and image protection schemes. An improved watermark error correction scheme is presented. The studies contribute to the overall development of the North+region, provide future generations with widespread public access to digital materials. We achieve a long-term storage, secure data protection and interactive web presence.

Mots clés

  • Data protection
  • watermarking
  • error-correcting codes
Accès libre

Parallel Fast Walsh Transform Algorithm and Its Implementation with CUDA on GPUs

Publié en ligne: 26 May 2018
Pages: 21 - 43

Résumé

Abstract

Some of the most important cryptographic characteristics of the Boolean and vector Boolean functions (nonlinearity, autocorrelation, differential uniformity) are connected with the Walsh spectrum. In this paper, we present several algorithms for computing the Walsh spectrum implemented in CUDA for parallel execution on GPU. They are based on the most popular sequential algorithm. The algorithms differ in the complexity of implementations, resources used, optimization strategies and techniques. In the end, we give some experimental results.

Mots clés

  • Walsh transform
  • CUDA C
  • GPU
  • Fast Walsh transform
  • Parallel algorithms
Accès libre

About an Approach for Constructing Combinatorial Objects

Publié en ligne: 26 May 2018
Pages: 44 - 53

Résumé

Abstract

The classification of combinatorial objects consists of two sub-problems – construction of objects with given properties and rejection of isomorphic objects. In this paper, we consider generation of combinatorial objects that are uniquely defined by a matrix. The method that we present is implemented by backtrack search. The used approach is close to dynamic programming.

Mots clés

  • Partitioning of integers
  • generating combinatorial objects
  • backstrack search
Accès libre

On Almost Complete Caps in PG(N, q)

Publié en ligne: 26 May 2018
Pages: 54 - 62

Résumé

Abstract

We propose the concepts of almost complete subset of an elliptic quadric in the projective space PG(3, q) and of almost complete cap in the space PG(N, q), N ≥ 3, as generalizations of the concepts of almost complete subset of a conic and of almost complete arc in PG(2, q). Upper bounds of the smallest size of the introduced geometrical objects are obtained by probabilistic and algorithmic methods.

Mots clés

  • Projective space
  • complete cap
  • complete arc
  • almost complete cap
  • almost complete arc
Accès libre

New Results on Binary Codes Obtained by Doubling Construction

Publié en ligne: 26 May 2018
Pages: 63 - 76

Résumé

Abstract

Binary codes created by doubling construction, including quasi-perfect ones with distance d = 4, are investigated. All [17·2r−6, 17·2r−6 − r, 4] quasi-perfect codes are classified. Weight spectrum of the codes dual to quasi-perfect ones with d = 4 is obtained. The automorphism group Aut(C) of codes obtained by doubling construction is studied. A subgroup of Aut(C) is described and it is proved that the subgroup coincides with Aut(C) if the starting matrix of doubling construction has an odd number of columns. (It happens for all quasi-perfect codes with d = 4 except for Hamming one.) The properness and t-properness for error detection of codes obtained by doubling construction are considered.

Mots clés

  • Linear binary codes
  • doubling construction
  • quasi-perfect codes
  • automorphism group of a code
  • proper and t-proper codes
Accès libre

Sequential Decoding on Syndrome Trellises for Nonparametric Detection

Publié en ligne: 26 May 2018
Pages: 77 - 86

Résumé

Abstract

The following paper adapts the classical Zigangirov-Jelinek algorithm to the decoding of nonbinary block codes under severe mixed jamming. To ensure reliable communications in this scenario we combine reception techniques based on distribution free statistical tests with sequential decoding on syndrome trellises. It will be shown that the proposed approach can ensure relatively high transmission rate with reasonable complexity.

Mots clés

  • Nonparametric detection
  • syndrome trellis
  • sequential decoding
  • decoding complexity
Accès libre

On the Classification of Splitting (v, u×c, λ) BIBDs

Publié en ligne: 26 May 2018
Pages: 87 - 94

Résumé

Abstract

The (v, u×c, λ)-splitting balanced incomplete block designs correspond to c-splitting authentication codes. We classify splitting balanced incomplete block designs with definite parameters.

Mots clés

  • Splitting balanced incomplete block design
  • splitting authentication code
9 Articles
Accès libre

Preface

Publié en ligne: 26 May 2018
Pages: 3 - 3

Résumé

Abstract

This volume contains selected papers from the Eighth International Workshop on Optimal Codes and Related Topics (OCRT’2017) organized as minisymposium during the conference Mathematical days in Sofia (10-14 July 2017). This workshop was organized by the Institute of Mathematics and Informatics of the Bulgarian Academy of Sciences. There were 37 participants and 26 contributed talks.

Accès libre

On Tight Optimal Conflict-Avoiding Codes for 3, 4, 5 and 6 Active Users

Publié en ligne: 26 May 2018
Pages: 5 - 11

Résumé

Abstract

We classify tight optimal conflict-avoiding codes of weights 3, 4, 5 and 6 and given small lengths.

Mots clés

  • Conflict-avoiding codes
  • tight optimal codes
  • protocol sequences
Accès libre

Software Approaches and Methods to Ensure the Security of Interactive Systems

Publié en ligne: 26 May 2018
Pages: 12 - 20

Résumé

Abstract

In the paper are studied methods for protection of interactive systems and digital archives against unauthorized distribution of digital content. We make an overview of steganographic methods and image protection schemes. An improved watermark error correction scheme is presented. The studies contribute to the overall development of the North+region, provide future generations with widespread public access to digital materials. We achieve a long-term storage, secure data protection and interactive web presence.

Mots clés

  • Data protection
  • watermarking
  • error-correcting codes
Accès libre

Parallel Fast Walsh Transform Algorithm and Its Implementation with CUDA on GPUs

Publié en ligne: 26 May 2018
Pages: 21 - 43

Résumé

Abstract

Some of the most important cryptographic characteristics of the Boolean and vector Boolean functions (nonlinearity, autocorrelation, differential uniformity) are connected with the Walsh spectrum. In this paper, we present several algorithms for computing the Walsh spectrum implemented in CUDA for parallel execution on GPU. They are based on the most popular sequential algorithm. The algorithms differ in the complexity of implementations, resources used, optimization strategies and techniques. In the end, we give some experimental results.

Mots clés

  • Walsh transform
  • CUDA C
  • GPU
  • Fast Walsh transform
  • Parallel algorithms
Accès libre

About an Approach for Constructing Combinatorial Objects

Publié en ligne: 26 May 2018
Pages: 44 - 53

Résumé

Abstract

The classification of combinatorial objects consists of two sub-problems – construction of objects with given properties and rejection of isomorphic objects. In this paper, we consider generation of combinatorial objects that are uniquely defined by a matrix. The method that we present is implemented by backtrack search. The used approach is close to dynamic programming.

Mots clés

  • Partitioning of integers
  • generating combinatorial objects
  • backstrack search
Accès libre

On Almost Complete Caps in PG(N, q)

Publié en ligne: 26 May 2018
Pages: 54 - 62

Résumé

Abstract

We propose the concepts of almost complete subset of an elliptic quadric in the projective space PG(3, q) and of almost complete cap in the space PG(N, q), N ≥ 3, as generalizations of the concepts of almost complete subset of a conic and of almost complete arc in PG(2, q). Upper bounds of the smallest size of the introduced geometrical objects are obtained by probabilistic and algorithmic methods.

Mots clés

  • Projective space
  • complete cap
  • complete arc
  • almost complete cap
  • almost complete arc
Accès libre

New Results on Binary Codes Obtained by Doubling Construction

Publié en ligne: 26 May 2018
Pages: 63 - 76

Résumé

Abstract

Binary codes created by doubling construction, including quasi-perfect ones with distance d = 4, are investigated. All [17·2r−6, 17·2r−6 − r, 4] quasi-perfect codes are classified. Weight spectrum of the codes dual to quasi-perfect ones with d = 4 is obtained. The automorphism group Aut(C) of codes obtained by doubling construction is studied. A subgroup of Aut(C) is described and it is proved that the subgroup coincides with Aut(C) if the starting matrix of doubling construction has an odd number of columns. (It happens for all quasi-perfect codes with d = 4 except for Hamming one.) The properness and t-properness for error detection of codes obtained by doubling construction are considered.

Mots clés

  • Linear binary codes
  • doubling construction
  • quasi-perfect codes
  • automorphism group of a code
  • proper and t-proper codes
Accès libre

Sequential Decoding on Syndrome Trellises for Nonparametric Detection

Publié en ligne: 26 May 2018
Pages: 77 - 86

Résumé

Abstract

The following paper adapts the classical Zigangirov-Jelinek algorithm to the decoding of nonbinary block codes under severe mixed jamming. To ensure reliable communications in this scenario we combine reception techniques based on distribution free statistical tests with sequential decoding on syndrome trellises. It will be shown that the proposed approach can ensure relatively high transmission rate with reasonable complexity.

Mots clés

  • Nonparametric detection
  • syndrome trellis
  • sequential decoding
  • decoding complexity
Accès libre

On the Classification of Splitting (v, u×c, λ) BIBDs

Publié en ligne: 26 May 2018
Pages: 87 - 94

Résumé

Abstract

The (v, u×c, λ)-splitting balanced incomplete block designs correspond to c-splitting authentication codes. We classify splitting balanced incomplete block designs with definite parameters.

Mots clés

  • Splitting balanced incomplete block design
  • splitting authentication code

Planifiez votre conférence à distance avec Sciendo