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

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

Displaying similar documents to “Sender-equivocable encryption schemes secure against chosen-ciphertext attacks revisited”

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

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.

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.

What is Genselfdual?

Bouyukliev, Iliya, Bouyuklieva, Stefka, Dzhumalieva-Stoeva, Maria, Monev, Venelin (2016)

Serdica Journal of Computing

Similarity:

This paper presents developed software in the area of Coding Theory. Using it, all binary self-dual codes with given properties can be classified. The programs have consequent and parallel implementations. ACM Computing Classification System (1998): G.4, E.4.

On a complete set of operations for factorizing codes

Clelia De Felice (2006)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

It is known that the class of factorizing codes, i.e., codes satisfying the factorization conjecture formulated by Schützenberger, is closed under two operations: the classical composition of codes and substitution of codes. A natural question which arises is whether a finite set 𝒪 of operations exists such that each factorizing code can be obtained by using the operations in 𝒪 and starting with prefix or suffix codes. 𝒪 is named here a complete set of operations (for factorizing codes)....

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.

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.