A polynomial-based key distribution approach for wireless sensor networks
From MaRDI portal
(Redirected from Publication:724960)
Recommendations
- Key Predistribution Schemes Using Codes in Wireless Sensor Networks
- Key predistribution scheme using finite fields and Reed Muller codes
- Determining parameters of key predistribution schemes via linear codes in wireless sensor networks
- A deterministic key predistribution method for wireless sensor networks based on hypercube multivariate scheme
- Key predistribution schemes and one-time broadcast encryption schemes from algebraic geometry codes
Cites work
- scientific article; zbMATH DE number 3531305 (Why is no real title available?)
- scientific article; zbMATH DE number 1227010 (Why is no real title available?)
- scientific article; zbMATH DE number 1314690 (Why is no real title available?)
- scientific article; zbMATH DE number 708825 (Why is no real title available?)
- Annihilator properties of skew monoid rings.
- Convolutional codes I: Algebraic structure
- Convolutional codes. An algebraic approach
- Inverses of Linear Sequential Circuits
- Maximum distance separable convolutional codes
- On cyclic convolutional codes
- On the structure of convolutional and cyclic convolutional codes
- Structure and constructions of cyclic convolutional codes
Cited in
(1)
This page was built for publication: A polynomial-based key distribution approach for wireless sensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724960)