A prime decomposition algorithm for supercodes

Hung Van Kieu
Author affiliations

Authors

  • Hung Van Kieu

DOI:

https://doi.org/10.15625/1813-9663/29/4/4342

Keywords:

Code, supercode, prime supercode, prime decomposition

Abstract

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.

Metrics

Metrics Loading ...

Published

13-12-2013

How to Cite

[1]
H. V. Kieu, “A prime decomposition algorithm for supercodes”, JCC, vol. 29, no. 4, pp. 351–357, Dec. 2013.

Issue

Section

Computer Science