Results 111 to 120 of about 145 (141)
Some of the next articles are maybe not open access.
Automorphisms of Hermitian generalized algebraic geometry codes
Journal of Pure and Applied Algebra, 2016Generalized algebraic geometry (GAG) codes were proposed by Xing, Neiderreiter and Lam [\textit{C. Xing} et al., IEEE Trans. Inf. Theory 45, No. 7, 2498--2501 (1999; Zbl 0956.94023)] with the purpose of improving the performances of the algebraic geometry (Goppa) codes [\textit{V. D. Goppa}, Sov. Math., Dokl.
openaire +1 more source
Computing automorphism groups of error-correcting codes
IEEE Transactions on Information Theory, 1982An algorithm is described for computing the automorphism group of an error correcting code. The algorithm determines the order of the automorphism group and produces a set of monomial permutations which generate the group. It has been implemented on a computer and has been used successfully on a great number of codes of moderate length.
openaire +1 more source
The Automorphism Groups of the Kerdock Codes
Journal of Information and Optimization Sciences, 1991Abstract We prove that the automorphism group of the Kerdock code of length 2 m (m even ≥6) is the group of permutations on GF(2 m )≈GF(2 m–1 )×GF(2) generated by the automorphism group of the field GF(2 m–1 ), the affine group of GF(2 m–1 ), and the translations on GF(2).
openaire +1 more source
On automorphism groups of the Hermitian codes
IEEE Transactions on Information Theory, 1995The author studies algebraic-geometric Goppa codes that can be obtained from Hermitean curves over \(GF(q^2)\). He determines the automorphism group of these codes in the interesting cases to be isomorphic to a subgroup of automorphisms of the curve that have a special form. This group has order \(q^3 (q^2-1)\).
openaire +2 more sources
The automorphism group of double-error-correcting BCH codes
IEEE Transactions on Information Theory, 1994After the description of primitive cyclic codes the author characterizes the permutations of support of a cyclic code which leaves the code globally invariant. In consequence of this description he gets the following: Corollary. The permutation group of a cyclic code \(C\) over \(K= \text{GF} (q)\), of length \(n=g^ m-1\) contains the permutations of ...
openaire +2 more sources
On the Weights of Linear Codes With Prescribed Automorphisms
IEEE Transactions on Information TheoryzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gaojun Luo +3 more
openaire +2 more sources
Constructions, decoding and automorphisms of subspace codes
2013Subspace codes are a family of codes used for (among others) random network coding, which is a model for multicast communication. These codes are defined as sets of vector spaces over a finite field. The main research problems arising in this area are the construction of codes with large cardinality for a given length and minimum distance and the ...
openaire +1 more source
Integrative oncology: Addressing the global challenges of cancer prevention and treatment
Ca-A Cancer Journal for Clinicians, 2022Jun J Mao,, Msce +2 more
exaly