On Hamming and b-symbol distance distributions of repeated-root constacyclic codes of length $$4p^s$$ over $${\pmb {\mathbb {F}}}_{p^m}+u {\pmb {\mathbb {F}}}_{p^m}$$.
Hai Q. DinhAbhay Kumar SinghMadhu Kant ThakurPublished in: J. Appl. Math. Comput. (2021)
Keyphrases
- program synthesis
- distance measure
- hamming distance
- special case
- kullback leibler divergence
- error correction
- probability distribution
- euclidean distance
- vertex set
- symbol recognition
- distance transform
- random variables
- relational learning
- distance function
- binary codes
- error correcting
- supervised learning
- kullback leibler distance