Let \(C\) be a \(q\)-ary block code and \(D(c_1,\ldots,c_t)\) denote the number of coordinate positions for any of which its values for these codewords are pairwise different. The minimal value \(d_t(C)\) of \(|D(c_1,\ldots,c_t)|\) over all sets of \(t\) codewords \(c_1,\ldots,c_t\) is called \(t\)-(hash) distance and if \(d_t(C)\geq 1\) then \(C\) is called \(t\)-(hash) code. The authors estimate \(t\)-distance of some classes of MDS codes and obtain conditions for the existence of linear \(t\)-codes of dimension two. Also, they derive an asymptotic upper bound on the rate of linear \(t\)-codes.
This page was built for publication: On linear hash codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290830)
