Linear codes from perfect nonlinear mappings and their secret sharing schemes

By Claude Carlet, Cunsheng Ding, Jin Yuan. IEEE Transactions on Information Theory, 2005

381 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/40fe765f348f6289d6c6acfed51e0427de0580ff

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Kelan Ding
2. Cunsheng Ding

In Computer Networks and Communications

1. Kelan Ding
2. Cunsheng Ding

Citations in the corpus

• A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing (2015, background): “Any linear code over GF(p) can be employed to construct secret sharing schemes [1], [8], [25], [28].”