Zeszyty czasopisma

Tom 22 (2022): Zeszyt 3 (September 2022)

Tom 22 (2022): Zeszyt 2 (June 2022)

Tom 22 (2022): Zeszyt 1 (March 2022)

Tom 21 (2021): Zeszyt 4 (December 2021)

Tom 21 (2021): Zeszyt 3 (September 2021)

Tom 21 (2021): Zeszyt 2 (June 2021)

Tom 21 (2021): Zeszyt 1 (March 2021)

Tom 20 (2020): Zeszyt 6 (December 2020)
Special Zeszyt on New Developments in Scalable Computing

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

Tom 20 (2020): Zeszyt 4 (November 2020)

Tom 20 (2020): Zeszyt 3 (September 2020)

Tom 20 (2020): Zeszyt 2 (June 2020)

Tom 20 (2020): Zeszyt 1 (March 2020)

Tom 19 (2019): Zeszyt 4 (November 2019)

Tom 19 (2019): Zeszyt 3 (September 2019)

Tom 19 (2019): Zeszyt 2 (June 2019)

Tom 19 (2019): Zeszyt 1 (March 2019)

Tom 18 (2018): Zeszyt 5 (May 2018)
Special Thematic Zeszyt on Optimal Codes and Related Topics

Tom 18 (2018): Zeszyt 4 (November 2018)

Tom 18 (2018): Zeszyt 3 (September 2018)

Tom 18 (2018): Zeszyt 2 (June 2018)

Tom 18 (2018): Zeszyt 1 (March 2018)

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

Tom 17 (2017): Zeszyt 4 (November 2017)

Tom 17 (2017): Zeszyt 3 (September 2017)

Tom 17 (2017): Zeszyt 2 (June 2017)

Tom 17 (2017): Zeszyt 1 (March 2017)

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

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

Tom 16 (2016): Zeszyt 4 (December 2016)

Tom 16 (2016): Zeszyt 3 (September 2016)

Tom 16 (2016): Zeszyt 2 (June 2016)

Tom 16 (2016): Zeszyt 1 (March 2016)

Tom 15 (2015): Zeszyt 7 (December 2015)
Special Zeszyt on Information Fusion

Tom 15 (2015): Zeszyt 6 (December 2015)
Special Zeszyt on Logistics, Informatics and Service Science

Tom 15 (2015): Zeszyt 5 (April 2015)
Special Zeszyt on Control in Transportation Systems

Tom 15 (2015): Zeszyt 4 (November 2015)

Tom 15 (2015): Zeszyt 3 (September 2015)

Tom 15 (2015): Zeszyt 2 (June 2015)

Tom 15 (2015): Zeszyt 1 (March 2015)

Tom 14 (2014): Zeszyt 5 (December 2014)
Special Zeszyt

Tom 14 (2014): Zeszyt 4 (December 2014)

Tom 14 (2014): Zeszyt 3 (September 2014)

Tom 14 (2014): Zeszyt 2 (June 2014)

Tom 14 (2014): Zeszyt 1 (March 2014)

Tom 13 (2013): Zeszyt Special-Zeszyt (December 2013)

Tom 13 (2013): Zeszyt 4 (December 2013)
The publishing of the present issue (Tom 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.

Tom 13 (2013): Zeszyt 3 (September 2013)

Tom 13 (2013): Zeszyt 2 (June 2013)

Tom 13 (2013): Zeszyt 1 (March 2013)

Tom 12 (2012): Zeszyt 4 (December 2012)

Tom 12 (2012): Zeszyt 3 (September 2012)

Tom 12 (2012): Zeszyt 2 (June 2012)

Tom 12 (2012): Zeszyt 1 (March 2012)

Informacje o czasopiśmie
Format
Czasopismo
eISSN
1314-4081
Pierwsze wydanie
13 Mar 2012
Częstotliwość wydawania
4 razy w roku
Języki
Angielski

Wyszukiwanie

Tom 18 (2018): Zeszyt 5 (May 2018)
Special Thematic Zeszyt on Optimal Codes and Related Topics

Informacje o czasopiśmie
Format
Czasopismo
eISSN
1314-4081
Pierwsze wydanie
13 Mar 2012
Częstotliwość wydawania
4 razy w roku
Języki
Angielski

Wyszukiwanie

9 Artykułów
Otwarty dostęp

Preface

Data publikacji: 26 May 2018
Zakres stron: 3 - 3

Abstrakt

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.

Otwarty dostęp

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

Data publikacji: 26 May 2018
Zakres stron: 5 - 11

Abstrakt

Abstract

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

Słowa kluczowe

  • Conflict-avoiding codes
  • tight optimal codes
  • protocol sequences
Otwarty dostęp

Software Approaches and Methods to Ensure the Security of Interactive Systems

Data publikacji: 26 May 2018
Zakres stron: 12 - 20

Abstrakt

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.

Słowa kluczowe

  • Data protection
  • watermarking
  • error-correcting codes
Otwarty dostęp

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

Data publikacji: 26 May 2018
Zakres stron: 21 - 43

Abstrakt

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.

Słowa kluczowe

  • Walsh transform
  • CUDA C
  • GPU
  • Fast Walsh transform
  • Parallel algorithms
Otwarty dostęp

About an Approach for Constructing Combinatorial Objects

Data publikacji: 26 May 2018
Zakres stron: 44 - 53

Abstrakt

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.

Słowa kluczowe

  • Partitioning of integers
  • generating combinatorial objects
  • backstrack search
Otwarty dostęp

On Almost Complete Caps in PG(N, q)

Data publikacji: 26 May 2018
Zakres stron: 54 - 62

Abstrakt

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.

Słowa kluczowe

  • Projective space
  • complete cap
  • complete arc
  • almost complete cap
  • almost complete arc
Otwarty dostęp

New Results on Binary Codes Obtained by Doubling Construction

Data publikacji: 26 May 2018
Zakres stron: 63 - 76

Abstrakt

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.

Słowa kluczowe

  • Linear binary codes
  • doubling construction
  • quasi-perfect codes
  • automorphism group of a code
  • proper and t-proper codes
Otwarty dostęp

Sequential Decoding on Syndrome Trellises for Nonparametric Detection

Data publikacji: 26 May 2018
Zakres stron: 77 - 86

Abstrakt

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.

Słowa kluczowe

  • Nonparametric detection
  • syndrome trellis
  • sequential decoding
  • decoding complexity
Otwarty dostęp

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

Data publikacji: 26 May 2018
Zakres stron: 87 - 94

Abstrakt

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.

Słowa kluczowe

  • Splitting balanced incomplete block design
  • splitting authentication code
9 Artykułów
Otwarty dostęp

Preface

Data publikacji: 26 May 2018
Zakres stron: 3 - 3

Abstrakt

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.

Otwarty dostęp

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

Data publikacji: 26 May 2018
Zakres stron: 5 - 11

Abstrakt

Abstract

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

Słowa kluczowe

  • Conflict-avoiding codes
  • tight optimal codes
  • protocol sequences
Otwarty dostęp

Software Approaches and Methods to Ensure the Security of Interactive Systems

Data publikacji: 26 May 2018
Zakres stron: 12 - 20

Abstrakt

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.

Słowa kluczowe

  • Data protection
  • watermarking
  • error-correcting codes
Otwarty dostęp

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

Data publikacji: 26 May 2018
Zakres stron: 21 - 43

Abstrakt

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.

Słowa kluczowe

  • Walsh transform
  • CUDA C
  • GPU
  • Fast Walsh transform
  • Parallel algorithms
Otwarty dostęp

About an Approach for Constructing Combinatorial Objects

Data publikacji: 26 May 2018
Zakres stron: 44 - 53

Abstrakt

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.

Słowa kluczowe

  • Partitioning of integers
  • generating combinatorial objects
  • backstrack search
Otwarty dostęp

On Almost Complete Caps in PG(N, q)

Data publikacji: 26 May 2018
Zakres stron: 54 - 62

Abstrakt

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.

Słowa kluczowe

  • Projective space
  • complete cap
  • complete arc
  • almost complete cap
  • almost complete arc
Otwarty dostęp

New Results on Binary Codes Obtained by Doubling Construction

Data publikacji: 26 May 2018
Zakres stron: 63 - 76

Abstrakt

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.

Słowa kluczowe

  • Linear binary codes
  • doubling construction
  • quasi-perfect codes
  • automorphism group of a code
  • proper and t-proper codes
Otwarty dostęp

Sequential Decoding on Syndrome Trellises for Nonparametric Detection

Data publikacji: 26 May 2018
Zakres stron: 77 - 86

Abstrakt

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.

Słowa kluczowe

  • Nonparametric detection
  • syndrome trellis
  • sequential decoding
  • decoding complexity
Otwarty dostęp

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

Data publikacji: 26 May 2018
Zakres stron: 87 - 94

Abstrakt

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.

Słowa kluczowe

  • Splitting balanced incomplete block design
  • splitting authentication code

Zaplanuj zdalną konferencję ze Sciendo