# On the Error-Correcting Performance of some Binary and Ternary Linear Codes

Serdica Journal of Computing (2007)

- Volume: 1, Issue: 2, page 157-170
- ISSN: 1312-6555

## Access Full Article

top## Abstract

top## How to cite

topBaicheva, Tsonka. "On the Error-Correcting Performance of some Binary and Ternary Linear Codes." Serdica Journal of Computing 1.2 (2007): 157-170. <http://eudml.org/doc/11416>.

@article{Baicheva2007,

abstract = {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 for a linear time. We have used a programm written in Maple to check the monotony of P(t)ue (C,p) for the investigated codes for a finite set of points of p € [0, p/(q-1)] and in this way to determine which of them are not proper.},

author = {Baicheva, Tsonka},

journal = {Serdica Journal of Computing},

keywords = {Proper Codes; Binary Cyclic Codes; Ternary Cyclic and Negacyclic Codes; proper codes; binary cyclic codes; ternary cyclic and negacyclic codes},

language = {eng},

number = {2},

pages = {157-170},

publisher = {Institute of Mathematics and Informatics Bulgarian Academy of Sciences},

title = {On the Error-Correcting Performance of some Binary and Ternary Linear Codes},

url = {http://eudml.org/doc/11416},

volume = {1},

year = {2007},

}

TY - JOUR

AU - Baicheva, Tsonka

TI - On the Error-Correcting Performance of some Binary and Ternary Linear Codes

JO - Serdica Journal of Computing

PY - 2007

PB - Institute of Mathematics and Informatics Bulgarian Academy of Sciences

VL - 1

IS - 2

SP - 157

EP - 170

AB - 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 for a linear time. We have used a programm written in Maple to check the monotony of P(t)ue (C,p) for the investigated codes for a finite set of points of p € [0, p/(q-1)] and in this way to determine which of them are not proper.

LA - eng

KW - Proper Codes; Binary Cyclic Codes; Ternary Cyclic and Negacyclic Codes; proper codes; binary cyclic codes; ternary cyclic and negacyclic codes

UR - http://eudml.org/doc/11416

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.