Ideal access structures based on a class of minimal linear codes

DOI10.1080/00207160.2015.1075986zbMath1420.94113OpenAlexW2218849129WikidataQ62038093 ScholiaQ62038093MaRDI QIDQ2958257

Yun Song, Zhi-Hui Li, Yong-Ming Li

Publication date: 1 February 2017

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2015.1075986

zbMATH Keywords

weight enumeratorirreducible cyclic codeperiod polynomialminimal linear codeideal access structure

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15)

Cites Work

• Unnamed Item
• An ideal multi-secret sharing scheme based on MSP
• Secret sharing schemes from binary linear codes
• The weight distribution of some irreducible cyclic codes
• Explicit lifts of quintic Jacobi sums and period polynomials for \(\mathbb F_q\)
• Hamming weights in irreducible cyclic codes
• Minimal codewords in Reed-Muller codes
• New classes of 2-weight cyclic codes
• Cheating-immune secret sharing schemes from codes and cumulative arrays
• Weight distribution of some reducible cyclic codes
• A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme
• A note on ramp secret sharing schemes from error-correcting codes
• How to share a secret
• Perfect secret sharing scheme based on vertex domination set
• Complex Codebooks From Combinatorial Designs
• Characterizing Ideal Weighted Threshold Secret Sharing
• Minimal vectors in linear codes
• The Weight Distribution of Some Irreducible Cyclic Codes

This page was built for publication: Ideal access structures based on a class of minimal linear codes