Calculation of the detection properties in the binary symmetrical channel

Rychtář, Adam; Klapka, Štěpán; Kárná, Lucie

The search session has expired. Please query the service again.

Displaying similar documents to “Calculation of the detection properties in the binary symmetrical channel”

Improving the Watermarking Process with Usage of Block Error-Correcting Codes

Berger, Thierry, Todorov, Todor (2008)

Serdica Journal of Computing

Similarity:

The emergence of digital imaging and of digital networks has made duplication of original artwork easier. Watermarking techniques, also referred to as digital signature, sign images by introducing changes that are imperceptible to the human eye but easily recoverable by a computer program. Usage of error correcting codes is one of the good choices in order to correct possible errors when extracting the signature. In this paper, we present a scheme of error correction based on a combination...

On the Error-Correcting Performance of some Binary and Ternary Linear Codes

Baicheva, Tsonka (2007)

Serdica Journal of Computing

Similarity:

In this work, we determine the coset weight spectra of all binary cyclic codes of lengths up to 33, ternary cyclic and negacyclic codes of lengths up to 20 and of some binary linear codes of lengths up to 33 which are distance-optimal, by using some of the algebraic properties of the codes and a computer assisted search. Having these weight spectra the monotony of the function of the undetected error probability after t-error correction P(t)ue (C,p) could be checked with any precision...

Detection codes in railway interlocking systems

Kárná, Lucie, Klapka, Štěpán

Similarity:

This paper describes a model of influence of random errors on the safety of the communication. The role of the communication in railway safety is specified. To ensure a safe communication, using of safety code is important. The most important parameter of the safety code is the maximal value of the probability of undetected error. Problems related with computing of this value are outlined in the article. As a model for the information transmission the binary symmetrical channel is introduced....

The check positions of Hamming codes and the construction of a 2EC-AUED code.

How, Guan Aun, Ang, Miin Huey (1998)

Bulletin of the Malaysian Mathematical Society. Second Series

Similarity:

Message doubling and error detection in the binary symmetrical channel

Kárná, Lucie, Klapka, Štěpán

Similarity:

The error correcting codes are a common tool to ensure safety in various safety-related systems. The usual technique, employed in the past, is to use two independent transmission systems and to send the safety relevant message two times. This article focuses on analysis of the detection properties of this strategy in the binary symmetrical channel (BSC) model. Besides, various modifications of the mentioned technique can be used. Their impact on the detection properties can be significant,...

Creation of unequal error protection codes for two groups of symbols

Eugeniusz Kuriata (2008)

International Journal of Applied Mathematics and Computer Science

Similarity:

This article presents problems of unequal information importance. The paper discusses constructive methods of code generation, and a constructive method of generating asymptotic UEP codes is built. An analog model of Hamming's upper bound and Hilbert's lower bound for asymptotic UEP codes is determined.

On Multiple Deletion Codes

Landjev, Ivan, Haralambiev, Kristiyan (2007)

Serdica Journal of Computing

Similarity:

In 1965 Levenshtein introduced the deletion correcting codes and found an asymptotically optimal family of 1-deletion correcting codes. During the years there has been a little or no research on t-deletion correcting codes for larger values of t. In this paper, we consider the problem of finding the maximal cardinality L2(n;t) of a binary t-deletion correcting code of length n. We construct an infinite family of binary t-deletion correcting codes. By computer search, we construct t-deletion...

On perfect-like binary and non-binary linear codes - a brief survey.

Dass, Bal Kishan, Das, Pankaj Kumar (2009)

Bulletin of the Malaysian Mathematical Sciences Society. Second Series

Similarity:

Divisible Codes - A Survey

Ward, Harold (2001)

Serdica Mathematical Journal

Similarity:

This paper surveys parts of the study of divisibility properties of codes. The survey begins with the motivating background involving polynomials over finite fields. Then it presents recent results on bounds and applications to optimal codes.

Ternary constant weight codes.

Östergård, Patric R.J., Svanström, Mattias (2002)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A simple proof for the existence of exponentially balanced Gray codes.

Suparta, I Nengah (2005)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Improvements on the Juxtaposing Theorem

Gashkov, Igor, Larsson, Henrik (2007)

Serdica Journal of Computing

Similarity:

A new class of binary constant weight codes is presented. We establish new lower bound and exact values on A(n1 +n2; 2(a1 +a2); n2) ≥ min {M1;M2}+1, if A(n1; 2a1; a1 +b1) = M1 and A(n2; 2b2; a2 +b2) = M2, in particular, A(30; 16; 15) = 16 and A(33; 18; 15) = 11.

Some MDS Codes over Gf(64) Connected with the Binary Doubly-Even [72,36,16] Code

Bouyuklieva, Stefka (2007)

Serdica Journal of Computing

Similarity:

* The author is supported by a Return Fellowship from the Alexander von Humboldt Foundation. MDS [8,4,5] codes over a field with 64 elements are constructed. All such codes which are self-dual under a Hermitian type inner product are classified. The connection between these codes and a putative binary self- dual [72,36,16] code is considered.

New Binary $[70, 35, 12]$ Self-Dual and Binary $[72, 36, 12]$ Self-Dual Doubly-Even Codes

Dontcheva, Radinka (2001)

Serdica Mathematical Journal

Similarity:

∗ This work was supported in part by the Bulgarian NSF under Grant MM-901/99 In this paper we prove that up to equivalence there exist 158 binary [70, 35, 12] self-dual and 119 binary [72, 36, 12] self-dual doubly-even codes all of which have an automorphism of order 23 and we present their construction. All these codes are new.

New Bounds for the Maximum Size of Ternary Constant Weight Codes

Bogdanova, Galina (2000)

Serdica Mathematical Journal

Similarity:

This work was partially supported by the Bulgarian National Science Fund under Grant I–618/96. Optimal ternary constant-weight lexicogarphic codes have been constructed. New bounds for the maximum size of ternary constant-weight codes are obtained. Tables of bounds on A3 (n, d, w) are given for d = 3, 4, 6.