1 citations · 1 across the 5 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2013
A short proof that all linear codes are weakly algebraic-geometric using Bertini theorems of B. Poonen
Srimathy Srinivasan
In this paper we give a simpler proof of a deep theorem proved by Pellikan, Shen and van Wee that all linear codes are weakly algebraic-geometric using a theorem of B.Poonen.
cs.IT2009
Codes on Planar Graphs
Srimathy Srinivasan, Andrew Thangaraj
Codes defined on graphs and their properties have been subjects of intense recent research. On the practical side, constructions for capacity-approaching codes are graphical. On th…