scientific article; zbMATH DE number 1245630
From MaRDI portal
Publication:4226403
The authors propose an algorithm for the fast construction of the collection of labellings that uses a random system of embedded coverings of almost all \(k\)-subsets of the set \(\{1,\dots, n\}\). Complexity estimates of the algorithm are obtained on the base of probabilistic properties of such systems. As possible applications, more economical decoding algorithms for Reed-Muller codes are mentioned. For the entire collection see [Zbl 0895.00020].
Recommendations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4226403)