A prime decomposition algorithm for supercodes

Hung Van Kieu


Supercode, a particular case of hypercodes, has been introduced and considered by D. L. Van and the author in previous papers. A supercode is called prime if it cannot be decomposed as a catenation of two supercodes. The prime decomposition of a supercode L is to decompose L into prime supercodes. In this paper, a linear-time prime decomposition algorithm for supercodes is proposed. The uniqueness of the prime decomposition for supercodes is presented.


Code, supercode, prime supercode, prime decomposition

DOI: https://doi.org/10.15625/1813-9663/29/4/4342 Display counter: Abstract : 155 views. PDF (Tiếng Việt) : 102 views. PDF : 20 views.


Journal of Computer Science and Cybernetics ISSN: 1813-9663

Published by Vietnam Academy of Science and Technology