TL;DR
This paper introduces an algorithm to determine if a regular code is a strong alt-induced code and explores the embedding problem for prefix, suffix, and bifix strong alt-induced codes in finite and regular cases.
Contribution
It presents a new algorithm for identifying strong alt-induced codes and addresses the embedding problem for these codes within specific classes.
Findings
Algorithm for checking strong alt-induced codes
Embedding results for prefix, suffix, bifix strong alt-induced codes
Application to finite and regular codes
Abstract
Strong alt-induced codes, a particular case of alt-induced codes, has been introduced and considered by D. L. Van and the author in earlier papers. In this note, an algorithm to check whether a regular code is strong alt-induced or not is proposed, and the embedding problem for the classes of prefix (suffix, bifix) strong alt-induced codes in both the finite and regular case is also exhibited.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.