1 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.IT2006★ 1 cited
A Combinatorial Family of Near Regular LDPC Codes
K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran +1
An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check codes achieving high girth is presented. The construction allows flexibi…
math.CO2006★ 1 cited
Hadwiger's Conjecture for Proper Circular Arc Graphs
Naveen Belkale, L. Sunil Chandran
Circular arc graphs are graphs whose vertices can be represented as arcs on a circle such that any two vertices are adjacent if and only if their corresponding arcs intersect. Prop…