- 期刊
A Construction of Some Group Codes
並列摘要
Let Σ* be the free monoid over a finite alphabet Σ and H a subgroup of a given group G. A group code X is the minimal generator of X* with X* =Ψ^(-1)(H), where Ψ is a morphism from the free monoid Σ* to the group G. In general, it is not obvious to detect if a subset X of Σ* is a code or not. In this paper, we use the fact that the syntactic monoid M(X*) of X* is isomorphic to the transition monoid of the minimal automaton recognizing X*, to giving some examples of groups codes based on the following two results from [1]: 1) The subset X of Σ* is a group code if and only if the monoid M(X*) is a group. 2) Let X □Σ* be a finite code, the syntactic monoid M(X*) is a group if and only if X =Σ^n for some a positif integer n. And in this case, the group M(X*) is a cyclic group of order n.
延伸閱讀
- (2004). Instructions to Contributors. The Changhua Journal of Medicine, 9(3), i-iii. https://www.airitilibrary.com/Article/Detail?DocID=16801504-200407-9-3-i-iii-o
- 史天元（2021）。On the Sequence of Coordinates。地籍測量：中華民國地籍測量學會會刊，40(1)，9-20。https://www.airitilibrary.com/Article/Detail?DocID=20725507-202103-202104230007-202104230007-9-20
- Tsai, C. Y., Ho, P. F., & Hwang, M. S. (2018). A Secure Group Signature Scheme. International Journal of Network Security, 20(2), 201-205. https://doi.org/10.6633/IJNS.201803.20(2).01
- MOČCKOŘ, J., & KONTOLATOU, A. (2005). COMPATIBLE ELEMENTS IN PARTLY ORDERED GROUPS. International Journal of Mathematics and Mathematical Sciences, 2005(), 4041-4048-324. https://doi.org/10.1155/IJMMS.2005.4041
- Lai, C. Y. (2006). A Construction of Quantum Stabilizer Codes [master's thesis, National Tsing Hua University]. Airiti Library. https://doi.org/10.6843/NTHU.2006.00528