↓ Skip to main content

Discrete Mathematics and Theoretical Computer Science

Overview of attention for book
Cover of 'Discrete Mathematics and Theoretical Computer Science'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Two Philosophical Applications of Algorithmic Information Theory
  3. Altmetric Badge
    Chapter 2 Covering and Secret Sharing with Linear Codes
  4. Altmetric Badge
    Chapter 3 Combinatorial Problems Arising in SNP and Haplotype Analysis
  5. Altmetric Badge
    Chapter 4 Cellular Automata and Combinatoric Tilings in Hyperbolic Spaces. A Survey
  6. Altmetric Badge
    Chapter 5 Generating Gray Codes in O(1) Worst-Case Time per Word
  7. Altmetric Badge
    Chapter 6 Listing Vertices of Simple Polyhedra Associated with Dual LI(2) Systems
  8. Altmetric Badge
    Chapter 7 Automatic Forcing and Genericity: On the Diagonalization Strength of Finite Automata
  9. Altmetric Badge
    Chapter 8 On the Order Dual of a Riesz Space
  10. Altmetric Badge
    Chapter 9 A Finite Complete Set of Equations Generating Graphs
  11. Altmetric Badge
    Chapter 10 ECO Method and the Exhaustive Generation of Convex Polyominoes
  12. Altmetric Badge
    Chapter 11 Regular Expressions with Timed Dominoes
  13. Altmetric Badge
    Chapter 12 On Infinitary Rational Relations and Borel Sets
  14. Altmetric Badge
    Chapter 13 Efficient Algorithms for Disjoint Matchings among Intervals and Related Problems
  15. Altmetric Badge
    Chapter 14 On Functions and Relations
  16. Altmetric Badge
    Chapter 15 Paths Coloring Algorithms in Mesh Networks
  17. Altmetric Badge
    Chapter 16 Finite State Strategies in One Player McNaughton Games
  18. Altmetric Badge
    Chapter 17 On Algebraic Expressions of Series-Parallel and Fibonacci Graphs
  19. Altmetric Badge
    Chapter 18 Boolean NP-Partitions and Projective Closure
  20. Altmetric Badge
    Chapter 19 On Unimodality of Independence Polynomials of Some Well-Covered Trees
  21. Altmetric Badge
    Chapter 20 A Coloring Algorithm for Finding Connected Guards in Art Galleries
  22. Altmetric Badge
    Chapter 21 An Analysis of Quantified Linear Programs
  23. Altmetric Badge
    Chapter 22 An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique
  24. Altmetric Badge
    Chapter 23 On the Monotonic Computability of Semi-computable Real Numbers
Attention for Chapter 2: Covering and Secret Sharing with Linear Codes
Altmetric Badge

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
1 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Covering and Secret Sharing with Linear Codes
Chapter number 2
Book title
Discrete Mathematics and Theoretical Computer Science
Published in
Lecture notes in computer science, June 2003
DOI 10.1007/3-540-45066-1_2
Book ISBNs
978-3-54-040505-4, 978-3-54-045066-5
Authors

Ding, Cunsheng, Yuan, Jin, Cunsheng Ding, Jin Yuan

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Professor 1 100%
Readers by discipline Count As %
Mathematics 1 100%