Computing separability elements for the sentence-ambient algebra of split ideal codes

DOI10.1016/j.jsc.2016.11.012zbMath1371.94681OpenAlexW2549156295MaRDI QIDQ2628320

Gabriel Navarro, F. J. Lobillo, José Gómez-Torrecillas

Publication date: 1 June 2017

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2016.11.012

zbMATH Keywords

separable ring extensionseparable automorphismsplit ideal code

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Ordinary and skew polynomial rings and semigroup rings (16S36) Computational aspects of associative rings (general theory) (16Z05) Convolutional codes (94B10)

Related Items (2)

Cyclic distances of idempotent convolutional codes ⋮ Biseparable extensions are not necessarily Frobenius

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convolutional codes with a matrix-algebra word-ambient
• Endomorphisms, derivations, and polynomial rings
• On cyclic convolutional codes
• Convolutional codes with additional algebraic structure
• On semisimple extensions and separable extensions over non commutative rings
• Separable algebras over commutative rings
• Separable Automorphisms on Matrix Algebras over Finite Field Extensions
• Structure and constructions of cyclic convolutional codes
• Ideal codes over separable ring extensions
• Convolutional codes I: Algebraic structure

This page was built for publication: Computing separability elements for the sentence-ambient algebra of split ideal codes