\(p(x)\)-circulants over finite fields and probability methods of their construction

DOI10.1134/S0001434614110303zbMath1321.15050OpenAlexW2068572381MaRDI QIDQ2343937

V. V. Gritsenko, A. É. Maevskii

Publication date: 11 May 2015

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434614110303

zbMATH Keywords

computational complexityfinite fielddeterminantinvertibilitytime complexity\(p(x)\)-circulantalgebra of \(p(x)\)-circulantsalgorithm of random choicerandom equiprobable choice

Mathematics Subject Classification ID

Theory of matrix inversion and generalized inverses (15A09) Determinants, permanents, traces, other special matrix functions (15A15) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Complexity and performance of numerical algorithms (65Y20)

Uses Software

• McEliece

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regular representations of semisimple algebras, separable field extensions, group characters, generalized circulants, and generalized cyclic codes
• Efficient algorithm for finding the inverse and the group inverse of FLS \(r\)-circulant matrix
• The discrete logarithm problem in the group of non-singular circulant matrices
• The Wire-Tap Channel
• Wire-Tap Channel II

This page was built for publication: \(p(x)\)-circulants over finite fields and probability methods of their construction