Search

Your search keyword '"Encheva, A."' showing total 13 results
Start Over Author "Encheva, A." Journal ieee transactions on information theory
13 results on '"Encheva, A."'

1. More on (2, 2)-separating systems

Author

Cohen, Gerard, Encheva, Sylvia, and Schaathun, Hans Georg

Subjects
Information theory -- Models, Error-correcting codes -- Analysis
Abstract

The theory of separating systems has been applied in different areas of science and technology such as automata synthesis, technical diagnosis, and authenticating ownership claims. Constructions of (2, 2)-separating systems derived from error-correcting codes are given, together with bounds on their parameters based on distance considerations. Index Terms--Copyright protection, error-correcting codes, separating systems, watermarking.

Published
2002

2. Constructions of intersecting codes

Author

Encheva, Sylvia B. and Cohen, Gerard D.

Subjects
Information theory -- Models, Codes -- Models, Coding theory -- Models
Abstract

New constructions of binary linear intersecting codes are presented. Some codes with high distances are shown to be intersecting. Index Terms - Binary linear intersecting codes.

Published
1999

3. Optimal binary linear codes and Z4-linearity

Author

Encheva, Sylvia B. and Jensen, Helge E.

Subjects
Coding theory -- Research, Information theory -- Research
Abstract

We give necessary and sufficient conditions for a binary linear code to be [Z.sub.4]-linear. Especially we treat optimal, binary linear codes and determine all such codes with minimum weight less or equal to six which are [Z.sub.4]-linear. Index Terms - Binary linear codes, codes over rings, optimal codes.

Published
1996

4. On binary linear codes which satisfy the two-way chain condition

Author

Encheva, Sylvia B.

Subjects
Coding theory -- Research, Codes -- Research
Abstract

General constructions of binary linear codes satisfying the two-way chain condition are found. Sufficient conditions for their existence are determined. Some of these codes are proven to be [Z.sub.4]-linear. An expression for their state complexity profile is also found. Cases, when such codes have covering radius R = t[n, k] are shown. Index Terms - Binary linear codes, two-way chain condition, state complexity.

Published
1996

5. Codes satisfying the chain condition

Author

Encheva, Sylvia and Klove, Torleiv

Subjects
Codes -- Analysis
Abstract

Codes satisfying the chain condition are discussed. In particular, all weight hierarchies of such codes of dimension 5 are determined.

Published
1994

6. On Binary Constructions of Quantum Codes

Author

Cohen, Gerard, Encheva, Sylvia, and Litsyn, Simon

Subjects
Information theory -- Research, Codes -- Research
Abstract

We improve estimates on the parameters of quantum codes obtained by Steane's construction from binary codes. This yields several new families of quantum codes. Index Terms--BCH codes, generalized distance, quantum codes.

Published
1999

7. Constructions of intersecting codes

Author

Gérard D. Cohen and Sylvia B. Encheva

Subjects
Discrete mathematics, business.industry, Binary number, Hamming distance, Cryptography, Library and Information Sciences, Linear code, Computer Science Applications, Binary code, business, Phase modulation, Decoding methods, Information Systems, Mathematics, Phase-shift keying
Abstract

New constructions of binary linear intersecting codes are presented. Some codes with high distances are shown to be intersecting.

Published
1999

8. On binary constructions of quantum codes

Author

Simon Litsyn, Gérard D. Cohen, and Sylvia B. Encheva

Subjects
Block code, Discrete mathematics, BCJR algorithm, Reed–Muller code, Quantum Physics, Library and Information Sciences, Luby transform code, Linear code, Expander code, Computer Science Applications, Computer Science::Emerging Technologies, Quantum convolutional code, Tornado code, Information Systems, Mathematics
Abstract

Recently, Steane (1998) proposed an enlargement of the Calderbank-Shor-Steane construction. Here we further improve on the parameters obtained from his construction, present examples of new codes, and analyze asymptotical non-constructive bounds.

Published
1999

9. Optimal binary linear codes and Z/sub 4/-linearity

Author

H.E. Jensen and S.B. Encheva

Subjects
Discrete mathematics, Combinatorics, Minimum weight, Linearity, Library and Information Sciences, Low-density parity-check code, Linear code, Hamming code, Binary linear codes, Computer Science Applications, Information Systems, Mathematics
Abstract

We give necessary and sufficient conditions for a binary linear code to be Z/sub 4/-linear. Especially we treat optimal, binary linear codes and determine all such codes with minimum weight less or equal to six which are Z/sub 4/-linear.

Published
1996

10. On binary linear codes which satisfy the two-way chain condition

Author

S.B. Encheva

Subjects
Discrete mathematics, Block code, Reed–Muller code, Library and Information Sciences, Luby transform code, Linear code, Expander code, Computer Science Applications, Combinatorics, Group code, Low-density parity-check code, Hamming code, Information Systems, Mathematics
Abstract

General constructions of binary linear codes satisfying the two-way chain condition are found. Sufficient conditions for their existence are determined. Some of these codes are proven to be Z/sub 4/-linear. An expression for their state complexity profile is also found. Cases, when such codes have covering radius R=t[n, k] are shown.

Published
1996

11. Codes satisfying the chain condition

Author

Torleiv Kløve and S. Encheva

Subjects
Discrete mathematics, Infinite set, Reed–Muller code, Binary code, Library and Information Sciences, Hamming code, Computer Science Applications, Information Systems, Mathematics
Abstract

The authors considered weight hierarchies of codes satisfying the chain condition, they called these chain-good. First, they gave a set of simple necessary conditions for a sequence to be chain-good. They proved that given one chain-good sequence, there is an infinite set of chain-good sequences that can be constructed from this one sequence. Finally, they used this result to completely describe the sets of chain-good sequences of dimensions up to 5. >

Published
1994

Catalog

Books, media, physical & digital resources
See catalog results