Search

Your search keyword '"G. Kabatiansky"' showing total 12 results
Start Over Author "G. Kabatiansky"
12 results on '"G. Kabatiansky"'

1. Coding of Messages at the Transport Layer of the Data Network

Author

Evgenii Krouk, G. Kabatiansky, and Sergei Semenov

Subjects
Message switching, chemistry.chemical_compound, Packet switching, Transmission delay, chemistry, business.industry, Computer science, Transport layer, Repetition code, business, Computer network, Coding (social sciences)
Published
2005

2. Reconciliation of Coding at Different Layers of a Network

Author

G. Kabatiansky, Sergei Semenov, and Evgenii Krouk

Subjects
Theoretical computer science, Shannon–Fano coding, Speech recognition, Codebook, Variable-length code, Vector quantisation, Coding gain, Mathematics, Coding (social sciences)
Published
2005

3. Providing Security of Data in a Network with the Help of Coding Methods

Author

Sergei Semenov, Evgenii Krouk, and G. Kabatiansky

Subjects
Public-key cryptography, Theoretical computer science, business.industry, McEliece cryptosystem, Hybrid cryptosystem, business, Computer security, computer.software_genre, computer, Mathematics, Coding (social sciences)
Published
2005

5. Codes with Algebraic Decoding

Author

Evgenii Krouk, Sergei Semenov, and G. Kabatiansky

Subjects
Discrete mathematics, Block code, Berlekamp–Welch algorithm, BCJR algorithm, Concatenated error correction code, Reed–Muller code, Tornado code, Luby transform code, Linear code, Mathematics
Published
2005

6. General Methods of Decoding of Linear Codes

Author

Evgenii Krouk, Sergei Semenov, and G. Kabatiansky

Subjects
Theoretical computer science, Information set, Berlekamp–Welch algorithm, List decoding, Sequential decoding, Decoding methods, Mathematics
Published
2005

9. Coverings, centered codes, and combinatorial steganography.

Author

F. Galand and G. Kabatiansky

Subjects
*CODING theory, *CRYPTOGRAPHY, *MATHEMATICAL analysis, *COMBINATORICS, *ERROR-correcting codes, *REED-Solomon codes, *ALGEBRAIC geometry
Abstract

Abstract  It is shown that steganography with a given distortion criteria, which we call combinatorial steganography, is equivalent to coverings of Hamming spaces or to so-called centered error-correcting codes, depending on whether an opponent is passive or active, respectively. A construction of centered error-correcting codes based on Reed-Solomon and algebraic geometry codes is proposed. [ABSTRACT FROM AUTHOR]

Published
2009
Full Text
View/download PDF

10. List decoding of the first-order binary Reed-Muller codes.

Author

I. Dumer, G. Kabatiansky, and C. Tavernier

Subjects
*ALGORITHMS, *STEINER systems, *PLANE geometry, *TRIANGLES
Abstract

Abstract  A list decoding algorithm is designed for the first-order binary Reed-Muller codes of length n that reconstructs all codewords located within the ball of radius n/2(1 − ɛ) about the received vector and has the complexity of O(n ln2(min{ɛ −2, n})) binary operations. [ABSTRACT FROM AUTHOR]

Published
2007
Full Text
View/download PDF

12. Finding passwords by random walks: how long does it take?

Author

G Kabatiansky and G Oshanin

Subjects
*RANDOM walks, *LAWN mowers, *STOCHASTIC processes, *SEARCH algorithms, *ALPHABETS, *MATHEMATICAL analysis
Abstract

We compare the efficiency of a deterministic 'lawnmower' and random search strategies for finding a prescribed sequence of letters (a password) of length M in which all letters are taken from the same Q-ary alphabet. We show that, at best, a random search takes two times longer than a 'lawnmower' search. [ABSTRACT FROM AUTHOR]

Published
2009
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results