WebMay 29, 2007 · Abstract: 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 … In this correspondence, two classes of cyclotomic linear codes over GF(q) of … In this correspondence, two classes of cyclotomic linear codes over GF(q) of … IEEE Transactions on Informat - Cyclotomic Linear Codes of Order - IEEE Journals … IEEE Xplore, delivering full text access to the world's highest quality technical … Featured on IEEE Xplore The IEEE Climate Change Collection. As the world's … WebCNVid-3.5M: Build, Filter, and Pre-train the Large-scale Public Chinese Video-text Dataset ... Preserving Linear Separability in Continual Learning by Backward Feature Projection Qiao Gu · Dongsub Shim · Florian Shkurti Multi-level Logit Distillation Ying Jin · Jiaqi Wang · Dahua Lin ... Graph Representation for Order-aware Visual ...
New Quantum Codes Derived from Cyclic Codes SpringerLink
WebIn 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 … WebApr 10, 2024 · Abstract. 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 ... howling wraiths spell dnd
Linear codes with few weights from cyclotomic classes and …
WebJun 1, 2015 · A classical method of constructing a linear code over GF(q) with a t-design is to use the incidence matrix of the t-design as a generator matrix over GF(q) of the code. This approach has been extensively investigated in the literature. WebThe generalized cyclotomic sequence of order 4 of period nis defined bywhere and are defined by (3) and . Here, in this paper, we treat it as a sequence over a finite field ,where . Denote the multiplicative order of lmodulo n. Let be an n-th primitive root of unity over . For the sequence defined by (15), we know Define δas follows: WebMar 9, 2024 · The construction of linear codes from cryptographic functions is an interesting problem. It is efficient to construct linear codes with good parameters from popular cryptographic functions such as perfect nonlinear functions [ 4 ], almost perfect nonlinear functions [ 22, 32 ], bent functions [ 3, 6, 29] and plateaued functions [ 26 ]. howling wraiths hollow knight