Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Linear codes from perfect nonlinear mappings and their secret sharing schemes

Published: 01 June 2005 Publication History

Abstract

In this paper, error-correcting codes from perfect nonlinear mappings are constructed, and then employed to construct secret sharing schemes. The error-correcting codes obtained in this paper are very good in general, and many of them are optimal or almost optimal. The secret sharing schemes obtained in this paper have two types of access structures. The first type is democratic in the sense that every participant is involved in the same number of minimal-access sets. In the second type of access structures, there are a few dictators who are in every minimal access set, while each of the remaining participants is in the same number of minimal-access sets.

Cited By

View all
  • (2024)More Differential Properties of the Ness-Helleseth FunctionIEEE Transactions on Information Theory10.1109/TIT.2024.340888270:8(6076-6090)Online publication date: 1-Aug-2024
  • (2024)Infinite Families of Few Weight Optimal Binary Linear Codes From Multivariable FunctionsIEEE Transactions on Information Theory10.1109/TIT.2024.340679870:10(6912-6931)Online publication date: 1-Oct-2024
  • (2024)New Constructions of Optimal Linear Codes From Simplicial ComplexesIEEE Transactions on Information Theory10.1109/TIT.2023.330560970:3(1823-1835)Online publication date: 1-Mar-2024
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Information Theory
IEEE Transactions on Information Theory  Volume 51, Issue 6
June 2005
328 pages

Publisher

IEEE Press

Publication History

Published: 01 June 2005

Author Tags

  1. Cryptography
  2. linear codes
  3. perfect nonlinear functions
  4. planar functions
  5. secret sharing schemes

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 13 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2024)More Differential Properties of the Ness-Helleseth FunctionIEEE Transactions on Information Theory10.1109/TIT.2024.340888270:8(6076-6090)Online publication date: 1-Aug-2024
  • (2024)Infinite Families of Few Weight Optimal Binary Linear Codes From Multivariable FunctionsIEEE Transactions on Information Theory10.1109/TIT.2024.340679870:10(6912-6931)Online publication date: 1-Oct-2024
  • (2024)New Constructions of Optimal Linear Codes From Simplicial ComplexesIEEE Transactions on Information Theory10.1109/TIT.2023.330560970:3(1823-1835)Online publication date: 1-Mar-2024
  • (2024)Additive codes with few weightsCryptography and Communications10.1007/s12095-024-00720-316:5(1077-1102)Online publication date: 1-Sep-2024
  • (2024)Optimal quinary cyclic codes with three zerosCryptography and Communications10.1007/s12095-024-00703-416:4(801-823)Online publication date: 1-Jul-2024
  • (2024)Determination for minimum symbol-pair and RT weights via torsional degrees of repeated-root cyclic codesApplicable Algebra in Engineering, Communication and Computing10.1007/s00200-023-00605-735:4(573-588)Online publication date: 1-Jul-2024
  • (2024)A class of three-weight linear codes over finite fields of odd characteristicApplicable Algebra in Engineering, Communication and Computing10.1007/s00200-022-00554-735:3(359-375)Online publication date: 1-May-2024
  • (2023)The Weight Distributions of Two Classes of Linear Codes From Perfect Nonlinear FunctionsIEEE Transactions on Information Theory10.1109/TIT.2023.334822870:6(4102-4109)Online publication date: 29-Dec-2023
  • (2023)Minimal p-Ary Codes via the Direct Sum of Functions, Non-Covering Permutations and Subspaces of DerivativesIEEE Transactions on Information Theory10.1109/TIT.2023.333857770:6(4445-4463)Online publication date: 30-Nov-2023
  • (2023)Subfield Codes of Several Few-Weight Linear Codes Parameterized by Functions and Their ConsequencesIEEE Transactions on Information Theory10.1109/TIT.2023.332893270:6(3941-3964)Online publication date: 3-Nov-2023
  • Show More Cited By

View Options

View options

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media