On the number of factorizations of polynomials over finite fields
- 8 April 2021
- journal article
- research article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 182, 105462
- https://doi.org/10.1016/j.jcta.2021.105462
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Israel Science Foundation
This publication has 13 references indexed in Scilit:
- On Decoding Rank-Metric Codes Over Large FieldsIEEE Transactions on Information Theory, 2018
- Some Gabidulin Codes Cannot Be List Decoded Efficiently at any RadiusIEEE Transactions on Information Theory, 2016
- On List-Decodability of Random Rank Metric Codes and Subspace CodesIEEE Transactions on Information Theory, 2014
- Coding for Errors and Erasures in Random Network CodingIEEE Transactions on Information Theory, 2008
- The Complete Analysis of a Polynomial Factorization Algorithm over Finite FieldsJournal of Algorithms, 2001
- Répartition Des Nombres Hautement Composés de RamanujanCanadian Journal of Mathematics, 1971
- An upper bound onk/nfor affine-invariant codes with fixedd/n(Corresp.)IEEE Transactions on Information Theory, 1969
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963
- On highly composite and similar numbersTransactions of the American Mathematical Society, 1944
- Highly Composite NumbersProceedings of the London Mathematical Society, 1915