Results 151 to 160 of about 173,309,485 (168)
Some of the next articles are maybe not open access.
Decomposing and shortening codes using automorphisms
IEEE Trans. Inf. Theory, 1986Codes possessing certain types of automorphisms are examined. In one case, the code can be decomposed as a direct sum of two subcodes, which can be viewed as shorter length codes. In a second case, the code itself corresponds to a shorter length code. Related results and applications are given.
openaire +2 more sources
Cyclic codes and the Frobenius automorphism
Archiv der Mathematik, 1999The main theorem of this paper provides the complete (and perhaps unexpected) solution of a problem posed by \textit{K. Burde} [J. Reine Angew. Math. 278/279, 353-364 (1975; Zbl 0323.12019)]. Let \(q=p^f\) be a prime power, \(n=p^bm\) with \(gcd(p,m)=1\). Consider \(K=GF(q^n)\) is an \(n\)-dimensional vector space over \(F=GF(q)\).
openaire +1 more source
Binary Self-Dual Codes With Automorphisms of Composite Order
IEEE Transactions on Information Theory, 2004S M Dodunekov
exaly
Constructions of Optimal Rank-Metric Codes From Automorphisms of Rational Function Fields
Advances in Mathematics of Communications, 2023exaly
The Complete SC-Invariant Affine Automorphisms of Polar Codes
2022Huazi Zhang, Zhiming Ma, Zicheng Ye
exaly
On Some Automorphisms of Order 3 of the Extremal Binary Codes
Electronic Notes in Discrete Mathematics, 2017Stefka Bouyuklieva
exaly
On the Automorphisms of Order 2 With Fixed Points for the Extremal Self-Dual Codes of Length 24
Designs, Codes, and Cryptography, 2002Stefka Bouyuklieva
exaly
Codes With a Certain Weight-Preserving Transitive Group of Automorphisms
Designs, Codes, and Cryptography, 2006exaly