In coding theory there are a number of codes which are studied. In this thesis we specifically consider a class of codes known as cyclic codes. This class of codes has a very nice algebraic structure. We are mainly going to examine weight distribution of a binary cyclic codes which contain the all-one vector. Weight distribution is said to provide information of both practical and theoretical significance. In this research we have used the group of cyclic shifts to examine the weight distribution of binary cyclic code. The group of cyclic shifts acts and fixes elements in the set of all codewords of a cyclic code. As a result of this, stabilizers and lengths of the orbits are established. The lengths of the orbits and their frequencies are used to obtain the weight distribution. Furthermore, we have shown that if the length of a cyclic code is an odd prime and two codewords the all-one and the all-zero are removed from a cyclic code then the number of codewords remaining is divisible by the length. The analysis and results in this thesis are useful to all mathematicians.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
(nessuna copia disponibile)
Cerca: Inserisci un desiderataNon riesci a trovare il libro che stai cercando? Continueremo a cercarlo per te. Se uno dei nostri librai lo aggiunge ad AbeBooks, ti invieremo una notifica!
Inserisci un desiderata