Cyclotomic linear codes of order 3
WebApr 10, 2024 · This work provides refined polynomial upper bounds for the condition number of the transformation between RLWE/PLWE for cyclotomic number fields with up to 6 primes dividing the conductor. We also provide exact expressions of the condition number for any cyclotomic field, but under what we call the twisted power basis. Finally, from a … Web3. A Family of New Cyclic Codes Defined by Our Sequences 3.1. The Properties on the Generalized Cyclotomy with Order Two Over . In this subsection, the following lemmas …
Cyclotomic linear codes of order 3
Did you know?
WebJun 1, 2007 · In this correspondence, two classes of cyclotomic linear codes over GF(q) of order 3 are constructed and their weight distributions are determined. The two classes … WebApr 15, 1998 · The autocorre- lation function of the ternary cyclotomic sequence of order 3 is given by AC, (T)=-l+ ( +l~), where s = e27'^1/3. Proof. We need results about cyclotomic numbers of order 3 which were determined by Dickson [4]. Let p = 3t + 1, then the cyclotomic numbers of order 3 are ( (,y)= ,n (Dy+l) , (,7e {0,l,2).
WebMay 31, 2024 · Basic concepts of linear codes 2. Bounds on size of codes 3. Finite fields 4. Cyclic codes 5. BCH and Reed-Soloman codes 6. Duadic codes 7. Weight distributions 8. Designs 9. Self-dual codes 10. Some favourite self-dual codes 11. Covering radius and cosets 12. Codes over Z4 13. Codes from algebraic geometry 14. Convolutional codes 15. WebJan 21, 2024 · In this paper, we give some results and properties of cyclic codes and the cyclotomic classes of order r in Section 2. In Section 3, we construct some dual-containing cyclic codes over \mathbb {F}_ {q}. We also obtain the bound of minimum distance of those cyclic codes and some optimal or almost optimal cyclic codes.
WebMar 9, 2024 · Next, we propose a class of linear codes constructed from cyclotomic classes. Let the linear code be defined by ( 2) and the defining set be given as follows: … WebThe cyclotomic classes of order Nare defined by C (N,r) i = α i αN for i= 0,1,··· ,N− 1, where hαNi denotes the subgroup of F∗ r generated by αN. In [31], Ding and Niederreiter constructed two classes of cyclotomic linear codes CD¯ over Fp of order 3 with defining sets D¯ = D 0 and D¯ = D 0 S D 1, where Dj = {αjα3i: i= 0,1 ...
WebCyclotomic linear codes of order 3: Authors: Ding, C. Niederreiter, H. Keywords: Cyclotomy Gaussian periods Linear codes Strongly regular graphs Two-weight codes: Issue Date: Jun-2007: Citation: Ding, C., Niederreiter, H. (2007-06). Cyclotomic linear codes of order 3. IEEE Transactions on Information Theory 53 (6) : 2274-2277.
WebThe linear complexity of a sequence is defined as the smallest order of linear feedback shift register that can generate the whole sequence. ... Ding, C. Cyclotomic constructions of cyclic codes with length being the product of two primes. IEEE Trans. Inf. Theory 2012, 58, 2231–2236. [Google Scholar] ... church on the horizon van wert ohioWebSep 1, 2013 · In this paper, three cyclotomic sequences of order four are employed to construct a number of classes of cyclic codes over GF (q) with prime length. Under … deweys pawn shop greenville south carolinaWebIn this correspondence, we construct twoclasses of linear codes with cyclotomic classes of order 3 and determine their weight distributions. Both classes contain optimal codes and … church on the hill washingtondeweys pawn shop on augusta roadWebVDOMDHTMLtml> In this correspondence, two classes of cyclotomic linear codes over GF (q) of order 3 are constructed and their weight distributions are determined. The two classes are two-weight codes and contain optimal codes. They are not equivalent to irreducible cyclic codes in general when q > 2. deweys pawn shop number cedar falls iaWebLinear codes with a few weights have been widely investigated in recent years. In this paper, we mainly use Gauss sums to represent the Hamming weights of a class of q-ary linear codes under some certain conditions, where q is a power of a prime. The ... deweys pawn shop in greenville scWebIn this paper, let $ q $ be a power of a prime, we construct several classes of new projective three-weight or four-weight linear codes over $ \mathbb{F}_q $ from the defining sets construction, and determine their weight distributions by using additive character sums. Especially, these codes are suitable for applications in secret sharing schemes. dewey sonic