On the dimension of graph codes with Reed-Solomon component codes
Peter Beelen, Tom Høholdt, Fernando Piñero, JØrn Justesen · 2013
We study a class of graph based codes with Reed-Solomon component codes as affine variety codes. We give a formulation of the exact dimension of graph codes in general. We give an algebraic description of these codes which makes the exact computation of the dimension of the graph codes easier.