A prime decomposition algorithm for supercodes | Zendy

Hung Van Kieu | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A prime decomposition algorithm for supercodes

Author(s) -

Hung Van Kieu

Publication year - 2014

Publication title -

journal of computer science and cybernetics

Language(s) - English

Resource type - Journals

eISSN - 2815-5939

pISSN - 1813-9663

DOI - 10.15625/1813-9663/29/4/4342

Subject(s) - prime (order theory) , decomposition , catenation , uniqueness , mathematics , algorithm , decomposition method (queueing theory) , discrete mathematics , computer science , combinatorics , chemistry , organic chemistry , dna , mathematical analysis , biochemistry

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. AMS Mathematics Subject Classification: 94A45, 68Q45.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research