Design of termination criterion of BMS algorithm for lexicographical ordering - Sorbonne Université Access content directly
Journal Articles Journal of Computer Applications Year : 2012

Design of termination criterion of BMS algorithm for lexicographical ordering

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.
No file

Dates and versions

hal-00765841 , version 1 (17-12-2012)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook X LinkedIn More