No article text was recorded for this version.
alphabet size constraints
Version 1 of 19 papers13 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Two Theorems in List Decoding
- Blog: An Improvement to Levenshtein's Upper Bound on the Cardinality of Deletion Correcting Codes
- Blog: Logarithmically larger deletion codes of all distances
- Blog: Bounds on the Zero-Error List-Decoding Capacity of the q/(q-1) Channel
- Blog: On Optimal Locally Repairable Codes with Super-Linear Length
- Blog: Explicit Codes Achieving List Decoding Capacity: Error-correction with Optimal Redundancy
- Blog: Sequence Reconstruction for the Single-Deletion Single-Substitution Channel
- Blog: Mean-Squared Accuracy of Good-Turing Estimator
- Blog: Explicit capacity-achieving list-decodable codes
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_alphabet_size_constraints_021bb7bb,
title = {alphabet size constraints},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/alphabet-size-constraints/rdr_021bb7bbfa4640849423acf20a69e4f8},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_alphabet_size_constraints_021bb7bb_v1,
title = {alphabet size constraints},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/alphabet-size-constraints/rdr_021bb7bbfa4640849423acf20a69e4f8/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}