Relationship between Mds Codes and Threshold Schemes

Electronics Letters

Volumn 24, Issue 3, 1988, Pages 154-156

  Xian, Yang Yi ^a  

^a BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

Author keywords

Codes and coding; Mathematical techniques

Indexed keywords

EID: 84935531957     PISSN: 00135194     EISSN: None     Source Type: Journal    
DOI: 10.1049/el:19880103     Document Type: Article

References (13)

1. Singleton, R. C.: ‘Maximum distance q-nary codes’, IEEE Trans., 1964, IT-10, pp. 116-118
2. Macwilliams, F. J., and Sloane, N. J. A.: ‘The theory of error correcting codes’ (North-Holland, New York, 1977)
3. Hill, R.: ‘A first course in coding theory’ (Clarendon Press, Oxford, 1986)
4. Chaum, D.: ‘Computer systems established, maintained, and trusted by mutually suspicious groups’ (University of California, Berkeley, CA, 1979), Memorandum no. UCB/ERL M79/10
5. Blakley, G. R.: ‘Safeguarding cryptographic keys’. Proceedings AFIPS 1979 national computer conference, Vol. 48, June, 1979, pp. 313-317
6. Shamir, A.: ‘How to share a secret’, Commun. ACM, 1979, 22, pp. 612-613
7. Chaum, D.: ‘How to keep a secret alive’. Lectures notes in computer science (196), advances in cryptography: Proceedings of CRYPTO ‘84, pp. 481-485
8. BosSen, D. C.: ‘b-adjacent error correction’, IBM J. Res. Dev., 1970, 14, pp. 402-408
9. BosSen, D. C., and Yau, S. S.: ‘Redundant residue polynomial codes’, Inf. & Control, 1968, 13, pp. 597-618
10. Mandelbaum, D.: ‘A method of coding for multiple errors’, IEEE Trans., 1968, IT-14, pp. 518-521
11. Mandelbaum, D.: ‘On decoding of Reed-Solomon codes’, IEEE Trans., 1971, IT-17, pp. 707-712
12. Mandelbaum, D.: ‘Some results in decoding of certain maximal distance and BCH codes’, Inf. & Control, 1972, 20
13. Assmus, E. F., et al.: ‘New 5-designs’, J. Comb. Theory, 1969, 6