Skip to Main content Skip to Navigation
Journal articles

Design of termination criterion of BMS algorithm for lexicographical ordering

Chenqi Mou 1, 2, *
* Corresponding author
2 PolSys - Polynomial Systems
Inria Paris-Rocquencourt, LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : The BMS algorithm from Coding Theory has good decoding efficiency and error-correcting capability, and current work usually focuses on the case of graded orderings. With the analysis on the essential characteristics of lexicographical and graded orderings, a termination criterion of BMS algorithm for the lexicographical ordering is designed by using the elimination property of Gröbner bases, which are closely related to the BMS algorithm, and an implementation-oriented description for the algorithm based on this criterion is also provided. Experimental results verify the effectiveness of the proposed termination criterion, and the new criterion matches the original theoretical one in the algorithm.
Document type :
Journal articles
Complete list of metadata

https://hal.sorbonne-universite.fr/hal-00765841
Contributor : Chenqi Mou <>
Submitted on : Monday, December 17, 2012 - 6:25:59 AM
Last modification on : Tuesday, March 2, 2021 - 1:56:07 PM

Identifiers

Citation

Chenqi Mou. Design of termination criterion of BMS algorithm for lexicographical ordering. Journal of Computer Applications, Science Press, 2012, 32 (11), pp.2977--2980. ⟨10.3724/SP.J.1087.2012.02977⟩. ⟨hal-00765841⟩

Share

Metrics

Record views

630