2 citations · 2 across the 2 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2015★ 2 cited
On the minimum distance of elliptic curve codes
Jiyou Li, Daqing Wan, Jun Zhang
Computing the minimum distance of a linear code is one of the fundamental problems in algorithmic coding theory. Vardy [14] showed that it is an \np-hard problem for general linear…
cs.IT2012
New Deep Holes of Generalized Reed-Solomon Codes
Jun Zhang, Fang-Wei Fu, Qun-Ying Liao
Deep holes play an important role in the decoding of generalized Reed-Solomon codes. Recently, Wu and Hong \cite{WH} found a new class of deep holes for standard Reed-Solomon codes…