摘要
An authentication-secrecy code based on the rational normal curves over finite fields was constructed,whose probabilities of successful deception achieve their information-theoretic bounds.The set of encoding rules for this code is a representation system for cosets of a certain subgroup in the projective transformation group.A special case is studied,i.e.the rational normal curves are the conies over finite fields.The representation system for the cosets which determines the set of encoding rules will be given.
An authentication-secrecy code based on the rational normal curves over finite fields was constructed,whose probabilities of successful deception achieve their information-theoretic bounds.The set of encoding rules for this code is a representation system for cosets of a certain subgroup in the projective transformation group.A special case is studied,i.e.the rational normal curves are the conies over finite fields.The representation system for the cosets which determines the set of encoding rules will be given.
基金
Project supported by the National Natural Science Foundation of China and the Natural Science Foundation of Guangdong Province.
