4 citations · 7 across the 6 of their papers we have counts for
Showing 2015 · cs.ITShow all
2 papers · 2 filters
cs.IT2015★ 1 cited
Greedy Construction of DNA Codes and New Bounds
Nabil Bennenni, Kenza Guenda, T. Aaron Gulliver
In this paper, we construct linear codes over with bounded -content. The codes are obtained using a greedy algorithm over . Further, upper and lowe…
cs.IT2015
Constacyclic Codes Over Finite Principal Ideal Rings
Aicha Batoul, Kenza Guenda, T. Aaron Gulliver
In this paper, we give an important isomorphism between contacyclic codes and cyclic codes over finite principal ideal rings. Necessary and sufficient conditions for the existence…