On additive cyclic codes
||The system is temporarily closed to updates for reporting purpose.
Özdemir, Funda (2016) On additive cyclic codes. [Thesis]
Official URL: http://risc01.sabanciuniv.edu/record=b1640335 (Table of Contents)
In this thesis we consider two problems related to additive cyclic codes. In the first part, we obtain a lower bound on the minimum distance of additive cyclic codes via the number of rational points on certain algebraic curves over finite fields. This is an extension of the analogous bound for classical cyclic codes. Our result is the only general bound on such codes aside from Bierbrauer's BCH bound. We compare our bound's performance against the BCH bound for additive cyclic codes in a special case and provide examples where it yields better results. In the second part, we study complementary dual additive cyclic codes. We give a suficient condition for a special class of additive cyclic codes to be complementary dual.
|Additional Information:||Yükseköğretim Kurulu Tez Merkezi Tez No: 444537.|
|Uncontrolled Keywords:||Additive cyclic code. -- Algebraic curve over a ﬁnite ﬁeld. -- Hasse-Weil bound. -- BCH bound. -- Complementary dual code. -- Toplamsal devirsel kod. -- Sonlu bir cisim üzerinde cebirsel eğri. -- Hasse-Weil sınırı. -- BCH sınırı. -- Bütünleyici dual kod.|
|Subjects:||Q Science > QA Mathematics|
|Deposited On:||16 Apr 2018 16:59|
|Last Modified:||25 Mar 2019 17:24|
Repository Staff Only: item control page