Old Web
English
Sign In
Acemap
>
Paper
>
The Modular Subset-Sum Problem and the size of deletion correcting codes - Designs, Codes and Cryptography
The Modular Subset-Sum Problem and the size of deletion correcting codes - Designs, Codes and Cryptography
2022
Khodakhast Bibak
Behrouz Zolfaghari
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]