#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2005

2011

- This year (0)
- Last 5 years (0)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Irina Naydenova, Torleiv KlÃ¸ve
- IEEE Trans. Information Theory
- 2007

Bose and Lin introduced a class of systematic codes for detection of binary asymmetric errors. Later, in [4] this class was generalized and the Generalized Bose-Lin (GBL) codes were introduced. In this note, we describe a Generalized Bose-Lin codes of limited magnitude l. For these codes, the possible undetectable errors are characterized, the undetectableâ€¦ (More)

- Irina Naydenova, Torleiv KlÃ¸ve
- Proceedings. International Symposium onâ€¦
- 2005

Linear codes for error detection on a q-ary symmetric channel are studied. It is shown that for given dimension k and minimum distance d, there exists a value mu(d, k) such that if C is a code of length n ges mu(d,k), then neither C nor its dual C<sup>perp</sup> are good for error detection. For d Gt k or k Gt d good approximations for mu(d, k) are given. Aâ€¦ (More)

- Irina Naydenova, Torleiv KlÃ¸ve
- IEEE Trans. Information Theory
- 2009

This paper is devoted to the non-symmetric channels. Here we will present t-EC-AUED codes. BÃ¶inck and van Tilborg gave a bound on the length of binary t-EC-AUED codes. A generalization of this bound to arbitrary alphabet size is given. This generalized BÃ¶inck van Tilborg bound, combined with constructions, is used to determine the length of some optimalâ€¦ (More)

- Irina Naydenova, Torleiv Klove
- IEEE Transactions on Information Theory
- 2007

Bose and Lin introduced a class of systematic codes for detection of binary asymmetric errors. In this note, we describe a generalization to q-ary asymmetric error detecting codes. For these codes, the possible undetectable errors are characterized and the undetectable errors of minimum weight are determined

- Irina Naydenova, Torleiv Klove
- IEEE Transactions on Information Theory
- 2009

Codes that can correct up to <i>t</i> symmetric errors and detect all unidirectional errors are studied. BOumlinck and van Tilborg gave a bound on the length of binary such codes. A generalization of this bound to arbitrary alphabet size is given. This generalized BOumlinck-van Tilborg bound, combined with constructions, is used to determine some optimalâ€¦ (More)

- Irina Naydenova, Torleiv KlÃ¸ve
- IEEE Transactions on Information Theory
- 2010

Codes for error detection on a <i>q</i>-ary symmetric channel are studied. Whether a code is good or not for error detection (in the technical sense) depends on the structure of the code. For some combinations of the main parameters length, size, and minimum distance, all code are good and for some other combinations all are ugly (stronger than not good).â€¦ (More)

- Torleiv KlÃ¸ve, Jinquan Luo, Irina Naydenova, Somaye Yari
- IEEE Transactions on Information Theory
- 2011

An error model with asymmetric errors of limited magnitude is a good model for some multilevel flash memories. This paper is about constructions of codes correcting such errors. The main results are about codes correcting a single such error and codes of length <i>m</i> correcting all errors in <i>m</i>-1 or less positions.

- Irina Naydenova, Torleiv Klove
- 2006 IEEE Information Theory Workshop - ITW '06â€¦
- 2006

Large codes are proper for error detection. In this paper we discuss how large is large. Using some known lemmas and theorems for proper codes we give a lower bound for the size of the code to be proper for error detection

- â€¹
- 1
- â€º