Bounds for codes for a non-symmetric ternary channel
Ludo Tolhuizen
TL;DR
This paper establishes bounds for ternary codes operating over a non-symmetric channel, modeled through the Manhattan distance, contributing to the understanding of code performance in such environments.
Contribution
It introduces new bounds specifically for ternary codes with Manhattan distance, addressing a gap in coding theory for non-symmetric channels.
Findings
Derived upper and lower bounds for ternary codes
Improved understanding of code limits in non-symmetric channels
Potential applications in communication systems with asymmetric noise
Abstract
We provide bounds for codes for a non-symmetric channel or, equivalently, for ternary codes with the Manhattan distance.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Error Correcting Code Techniques · Cooperative Communication and Network Coding