Displaying similar documents to “Improving the Watermarking Process with Usage of Block Error-Correcting Codes”

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...

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...

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....

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:

On some Optimal (n,t,1,2) and (n,t,1,3) Super Imposed Codes

Manev, Mladen (2009)

Serdica Journal of Computing

Similarity:

Partially supported by the Technical University of Gabrovo under Grant C-801/2008 One of the main problems in the theory of superimposed codes is to find the minimum length N for which an (N, T,w, r) superimposed code exists for given values of T , w and r. Let N(T,w, r) be the minimum length N for which an (N, T,w, r) superimposed code exists. The (N, T,w, r) superimposed code is called optimal when N = N(T,w, r). The values of N(T, 1, 2) are known for T ≤ 12 and the values...