Three classes of binary minimal linear codes from 2-to-1 functions
Minimal linear codes have important applications in secret sharing schemes and two-party secure computation.Based on 2-to-1 functions with good cryptographic properties,this paper constructs three classes of linear codes.From the distributions of Walsh spectrum values of the functions,the parameters and accurate weight distributions of the three classes of linear codes are determined.The results show that our linear codes are minimal,which satisfy the Ashikhmin-Barg condition.
binary linear codeminimal code2-to-1 functionAshikhmin-Barg condition
万方数据
维普
