Skip to content
DraconiticResearch
Search Sources API
203,203 studies31 sourcesUpdated 50 min ago
Peer-reviewedLicence not statedIEEE Transactions on Information Theory

Plotkin-Like Bound and Explicit Function-Correcting Code Constructions for Lee Metric Channels

  • K. Hareesh1
  • Rashid Ummer N. T.1
  • Balaji Sundar Rajan1
  1. 1Department of Electrical Communication Engineering, Indian Institute of Science, Bengaluru, India
Open at sourcePDFDOICite

Related

  1. Plotkin-type Bound on Function-Correcting Codes for Monomial Mappings
    Kanchana Lokshmii Jagatti, B. Sundar Rajan
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  2. A General Plotkin-type Bound on Function-Correcting Codes with Wyner-Graham Distance
    Kanchana Lokshmii Jagatti, K. Hareesh, N. T. Rashid Ummer +1
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  3. Generalized Function-Correcting Partition Codes: Bounds and constructions
    Charul Rajput, Mahak, V. Lalitha
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  4. Guaranteed indirect delivery in directed networks: The joint extremal function and explicit attaining constructions
    Angel Ivanov Raychev
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  5. Function-Correcting Lee-distance Codes for Symbol-Pair Read Channels
    Hareesh K., B. Sundar Rajan
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@article{hareesh2026plotkinlike,
  title = {{Plotkin-Like Bound and Explicit Function-Correcting Code Constructions for Lee Metric Channels}},
  author = {K. Hareesh and Rashid Ummer N. T. and Balaji Sundar Rajan},
  journal = {IEEE Transactions on Information Theory},
  year = {2026},
  month = may,
  doi = {10.1109/tit.2026.3697793},
  url = {https://arxiv.org/abs/2508.01702},
}
RIS
TY  - JOUR
TI  - Plotkin-Like Bound and Explicit Function-Correcting Code Constructions for Lee Metric Channels
AU  - K. Hareesh
AU  - Rashid Ummer N. T.
AU  - Balaji Sundar Rajan
PY  - 2026
DA  - 2026/05/28
JO  - IEEE Transactions on Information Theory
DO  - 10.1109/tit.2026.3697793
UR  - https://arxiv.org/abs/2508.01702
SN  - 0018-9448
SN  - 1557-9654
ER  -