Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Karthik Sheshadri

Karthik Sheshadri

1 indexed paper

Recent (6 mo)
1
With code
0
Influential cites
0
Benchmarked
0

Publications per year

1
26

Top categories

Complexity×1

Research Timeline

2026
Trellis State Complexity as an Exact Tropical Factorization Rank

This paper proves that the min-plus factorization rank and tropical rank of a binary linear code's conditional decoding matrix equal 2^s, where s is the classical state complexity of the minimal trellis of the code at a cut.

Highlighted terms show continued research focus across papers

Papers

cs.CCTheoreticalRecentJul 26, 2026

Trellis State Complexity as an Exact Tropical Factorization Rank

Karthik Sheshadri

This paper proves that the min-plus factorization rank and tropical rank of a binary linear code's conditional decoding matrix equal 2^s, where s is the classical state complexity of the minimal trell…

View →