Revista y Edición

Volumen 22 (2022): Edición 3 (September 2022)

Volumen 22 (2022): Edición 2 (June 2022)

Volumen 22 (2022): Edición 1 (March 2022)

Volumen 21 (2021): Edición 4 (December 2021)

Volumen 21 (2021): Edición 3 (September 2021)

Volumen 21 (2021): Edición 2 (June 2021)

Volumen 21 (2021): Edición 1 (March 2021)

Volumen 20 (2020): Edición 6 (December 2020)
Special Edición on New Developments in Scalable Computing

Volumen 20 (2020): Edición 5 (December 2020)
Special issue on Innovations in Intelligent Systems and Applications

Volumen 20 (2020): Edición 4 (November 2020)

Volumen 20 (2020): Edición 3 (September 2020)

Volumen 20 (2020): Edición 2 (June 2020)

Volumen 20 (2020): Edición 1 (March 2020)

Volumen 19 (2019): Edición 4 (November 2019)

Volumen 19 (2019): Edición 3 (September 2019)

Volumen 19 (2019): Edición 2 (June 2019)

Volumen 19 (2019): Edición 1 (March 2019)

Volumen 18 (2018): Edición 5 (May 2018)
Special Thematic Edición on Optimal Codes and Related Topics

Volumen 18 (2018): Edición 4 (November 2018)

Volumen 18 (2018): Edición 3 (September 2018)

Volumen 18 (2018): Edición 2 (June 2018)

Volumen 18 (2018): Edición 1 (March 2018)

Volumen 17 (2017): Edición 5 (December 2017)
Special Edición With Selected Papers From The Workshop “Two Years Avitohol: Advanced High Performance Computing Applications 2017

Volumen 17 (2017): Edición 4 (November 2017)

Volumen 17 (2017): Edición 3 (September 2017)

Volumen 17 (2017): Edición 2 (June 2017)

Volumen 17 (2017): Edición 1 (March 2017)

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

Volumen 16 (2016): Edición 5 (October 2016)
Edición Title: Special Edición on Application of Advanced Computing and Simulation in Information Systems

Volumen 16 (2016): Edición 4 (December 2016)

Volumen 16 (2016): Edición 3 (September 2016)

Volumen 16 (2016): Edición 2 (June 2016)

Volumen 16 (2016): Edición 1 (March 2016)

Volumen 15 (2015): Edición 7 (December 2015)
Special Edición on Information Fusion

Volumen 15 (2015): Edición 6 (December 2015)
Special Edición on Logistics, Informatics and Service Science

Volumen 15 (2015): Edición 5 (April 2015)
Special Edición on Control in Transportation Systems

Volumen 15 (2015): Edición 4 (November 2015)

Volumen 15 (2015): Edición 3 (September 2015)

Volumen 15 (2015): Edición 2 (June 2015)

Volumen 15 (2015): Edición 1 (March 2015)

Volumen 14 (2014): Edición 5 (December 2014)
Special Edición

Volumen 14 (2014): Edición 4 (December 2014)

Volumen 14 (2014): Edición 3 (September 2014)

Volumen 14 (2014): Edición 2 (June 2014)

Volumen 14 (2014): Edición 1 (March 2014)

Volumen 13 (2013): Edición Special-Edición (December 2013)

Volumen 13 (2013): Edición 4 (December 2013)
The publishing of the present issue (Volumen 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.

Volumen 13 (2013): Edición 3 (September 2013)

Volumen 13 (2013): Edición 2 (June 2013)

Volumen 13 (2013): Edición 1 (March 2013)

Volumen 12 (2012): Edición 4 (December 2012)

Volumen 12 (2012): Edición 3 (September 2012)

Volumen 12 (2012): Edición 2 (June 2012)

Volumen 12 (2012): Edición 1 (March 2012)

Detalles de la revista
Formato
Revista
eISSN
1314-4081
Publicado por primera vez
13 Mar 2012
Periodo de publicación
4 veces al año
Idiomas
Inglés

Buscar

Volumen 18 (2018): Edición 5 (May 2018)
Special Thematic Edición on Optimal Codes and Related Topics

Detalles de la revista
Formato
Revista
eISSN
1314-4081
Publicado por primera vez
13 Mar 2012
Periodo de publicación
4 veces al año
Idiomas
Inglés

Buscar

9 Artículos
Acceso abierto

Preface

Publicado en línea: 26 May 2018
Páginas: 3 - 3

Resumen

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.

Acceso abierto

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

Publicado en línea: 26 May 2018
Páginas: 5 - 11

Resumen

Abstract

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

Palabras clave

  • Conflict-avoiding codes
  • tight optimal codes
  • protocol sequences
Acceso abierto

Software Approaches and Methods to Ensure the Security of Interactive Systems

Publicado en línea: 26 May 2018
Páginas: 12 - 20

Resumen

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.

Palabras clave

  • Data protection
  • watermarking
  • error-correcting codes
Acceso abierto

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

Publicado en línea: 26 May 2018
Páginas: 21 - 43

Resumen

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.

Palabras clave

  • Walsh transform
  • CUDA C
  • GPU
  • Fast Walsh transform
  • Parallel algorithms
Acceso abierto

About an Approach for Constructing Combinatorial Objects

Publicado en línea: 26 May 2018
Páginas: 44 - 53

Resumen

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.

Palabras clave

  • Partitioning of integers
  • generating combinatorial objects
  • backstrack search
Acceso abierto

On Almost Complete Caps in PG(N, q)

Publicado en línea: 26 May 2018
Páginas: 54 - 62

Resumen

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.

Palabras clave

  • Projective space
  • complete cap
  • complete arc
  • almost complete cap
  • almost complete arc
Acceso abierto

New Results on Binary Codes Obtained by Doubling Construction

Publicado en línea: 26 May 2018
Páginas: 63 - 76

Resumen

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.

Palabras clave

  • Linear binary codes
  • doubling construction
  • quasi-perfect codes
  • automorphism group of a code
  • proper and t-proper codes
Acceso abierto

Sequential Decoding on Syndrome Trellises for Nonparametric Detection

Publicado en línea: 26 May 2018
Páginas: 77 - 86

Resumen

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.

Palabras clave

  • Nonparametric detection
  • syndrome trellis
  • sequential decoding
  • decoding complexity
Acceso abierto

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

Publicado en línea: 26 May 2018
Páginas: 87 - 94

Resumen

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.

Palabras clave

  • Splitting balanced incomplete block design
  • splitting authentication code
9 Artículos
Acceso abierto

Preface

Publicado en línea: 26 May 2018
Páginas: 3 - 3

Resumen

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.

Acceso abierto

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

Publicado en línea: 26 May 2018
Páginas: 5 - 11

Resumen

Abstract

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

Palabras clave

  • Conflict-avoiding codes
  • tight optimal codes
  • protocol sequences
Acceso abierto

Software Approaches and Methods to Ensure the Security of Interactive Systems

Publicado en línea: 26 May 2018
Páginas: 12 - 20

Resumen

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.

Palabras clave

  • Data protection
  • watermarking
  • error-correcting codes
Acceso abierto

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

Publicado en línea: 26 May 2018
Páginas: 21 - 43

Resumen

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.

Palabras clave

  • Walsh transform
  • CUDA C
  • GPU
  • Fast Walsh transform
  • Parallel algorithms
Acceso abierto

About an Approach for Constructing Combinatorial Objects

Publicado en línea: 26 May 2018
Páginas: 44 - 53

Resumen

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.

Palabras clave

  • Partitioning of integers
  • generating combinatorial objects
  • backstrack search
Acceso abierto

On Almost Complete Caps in PG(N, q)

Publicado en línea: 26 May 2018
Páginas: 54 - 62

Resumen

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.

Palabras clave

  • Projective space
  • complete cap
  • complete arc
  • almost complete cap
  • almost complete arc
Acceso abierto

New Results on Binary Codes Obtained by Doubling Construction

Publicado en línea: 26 May 2018
Páginas: 63 - 76

Resumen

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.

Palabras clave

  • Linear binary codes
  • doubling construction
  • quasi-perfect codes
  • automorphism group of a code
  • proper and t-proper codes
Acceso abierto

Sequential Decoding on Syndrome Trellises for Nonparametric Detection

Publicado en línea: 26 May 2018
Páginas: 77 - 86

Resumen

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.

Palabras clave

  • Nonparametric detection
  • syndrome trellis
  • sequential decoding
  • decoding complexity
Acceso abierto

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

Publicado en línea: 26 May 2018
Páginas: 87 - 94

Resumen

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.

Palabras clave

  • Splitting balanced incomplete block design
  • splitting authentication code

Planifique su conferencia remota con Sciendo