No article text was recorded for this version.
polynomial field size scaling
Version 1 of 113 papers18 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Lower Bounds for Maximally Recoverable Tensor Codes and Higher Order MDS Codes
- Blog: New Constructions of SD and MR Codes over Small Finite Fields
- Blog: A construction of Maximally Recoverable LRCs for small number of local groups
- Blog: A Bound on the Minimal Field Size of LRCs, and Cyclic MR Codes That Attain It
- Blog: Partial MDS Codes with Local Regeneration
- Blog: Partial MDS Codes with Regeneration
- Blog: A Construction of Maximally Recoverable Codes with Order-Optimal Field Size
- Blog: A Family of Erasure Correcting Codes with Low Repair Bandwidth and Low Repair Complexity
- Blog: An Application of Storage-Optimal MatDot Codes for Coded Matrix Multiplication: Fast k-Nearest Neighbors Estimation
- Blog: Improved Maximally Recoverable LRCs using Skew Polynomials
- Blog: Repair Optimal Erasure Codes Through Hadamard Designs
- Blog: Explicit Maximally Recoverable Codes with Locality
- Blog: MDS Array Codes With (Near) Optimal Repair Bandwidth for All Admissible Repair Degrees
History & citation
Current · Permanent link
- This direction split from field size complexity (85% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_polynomial_field_size_scaling_3e425ef0,
title = {polynomial field size scaling},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/polynomial-field-size-scaling/rdr_3e425ef0e5724b3ab9c059e8532397b7},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_polynomial_field_size_scaling_3e425ef0_v1,
title = {polynomial field size scaling},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/polynomial-field-size-scaling/rdr_3e425ef0e5724b3ab9c059e8532397b7/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}