عنوان

New single asymmetric error correcting codes

Number

TLpq304479454

.Language of Text, Soundtrack etc

انگلیسی

Title Proper

New single asymmetric error correcting codes

General Material Designation

[Thesis]

First Statement of Responsibility

S. A. M. Al-Muhammadi

Name of Publisher, Distributor, etc.

King Fahd University of Petroleum and Minerals (Saudi Arabia)

Date of Publication, Distribution, etc.

1998

Specific Material Designation and Extent of Item

60

Dissertation or thesis details and type of degree

M.S.

Body granting the degree

King Fahd University of Petroleum and Minerals (Saudi Arabia)

Text preceding or following the note

1998

Text of Note

Research in the area of asymmetric errors started the in late 1950's. Extensive research has been developed, since then, on the theory of asymmetric error-control codes. The interest in the asymmetric error-control codes has become increasingly apparent due to some new applications that assume asymmetric channels for communication. Failures in such channels normally result in asymmetric errors. This thesis presents new single asymmetric error correcting codes. These new codes have higher information rate than the existing codes for any code length greater than 10, except 12 and 15. It is known that, for a given length n, a code of size usd\lbrack 2\sp{n}/(n + 1)\rbrackusd can be obtained from the Abelian group partitioning of all the usd2\sp{n}usd binary code words. This thesis introduces codes of sizes greater than usd\lbrack 2\sp{n}/n\rbrackusd code words for many values of n. For usdn = 17,usd the size of the introduced code is usd2\sp,usd which is equal to usd\lbrack 2\sp{n}/(n - 1)\rbrack.usd So, it is now possible to encode the 13-bit messages into a single asymmetric error correcting code of length 17, i.e. with only four bits of redundancy. The construction method of the proposed codes is based on the Cartesian product of two sets of partitioned codes of smaller lengths. Two algorithms for finding good partitions are discussed. The first one is based on the Cartesian product method itself. The other is based on graph-coloring techniques. Using these algorithms, some useful partitions for the construction method were obtained.

Applied sciences

Computer science

S. A. M. Al-Muhammadi

Electronic name

p

[Thesis]

276903

a

Y