Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Bulk Modulus01:21

Bulk Modulus

728
The bulk modulus is a scientific term used to describe a material's resistance to uniform compression. It is the proportionality constant that links a change in pressure to the resulting relative volume change.
728
Application of Nonlinear Inequalities01:29

Application of Nonlinear Inequalities

214
A nonlinear inequality describes a comparison involving an expression that curves or behaves more complexly than a straight line. These inequalities often appear in forms that include squares, products, or variables in the denominator.To solve such an inequality, one starts by rewriting it so that zero appears on one side. For example, the inequality:  can be factored as: This form makes it easier to identify the values that cause the expression to equal zero. In this case, the...
214
Synthetic Disvision of Polynomials01:28

Synthetic Disvision of Polynomials

150
Synthetic division is an efficient algorithmic approach for dividing a polynomial by a linear binomial of the form x - c, where c is a real number. This method is helpful due to its streamlined process, which avoids the more cumbersome steps involved in the traditional long division of polynomials. It simplifies computation and serves as a practical tool for evaluating polynomials and identifying their factors.To perform synthetic division, one begins by listing the coefficients of the...
150
Long Division of Polynomials01:26

Long Division of Polynomials

274
Polynomial division is an essential algebraic process to simplify expressions and solve equations. Just as numerical division separates a number into quotient and remainder, polynomial long division partitions a polynomial into simpler components; in this context, the dividend is the polynomial being divided, the divisor is the expression dividing it, and the result is expressed in terms of a quotient and a remainder.The division begins by arranging the dividend and divisor in standard...
274
Rationalizing Substitutions01:29

Rationalizing Substitutions

29
Integrals involving non-rational functions are often difficult to evaluate using standard techniques, especially when radicals appear in the integrand. Rationalizing substitution provides a systematic method for simplifying such integrals by converting them into rational forms that are easier to handle.Consider a rod whose linear mass density depends on a constant linear density, a characteristic length, and the distance from the left end of the rod. Determining the total mass requires...
29
Critical Numbers and the Closed Interval Method01:21

Critical Numbers and the Closed Interval Method

33
Understanding the maximum and minimum values of a function is essential for analyzing its overall behavior. These values, often referred to as extrema, provide insight into how a function behaves across its domain. In mathematical terms, extrema can be either local—representing peaks and valleys within a limited region—or absolute, indicating the highest or lowest points over an entire interval.A function’s extrema occur at critical numbers, which are values in the domain...
33

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Uniqueness of codes using semidefinite programming.

Designs, codes, and cryptography·2019
Same journal

LRCS: Duality, LP bounds, and field size.

Designs, codes, and cryptography·2026
Same journal

Information-set decoding for convolutional codes.

Designs, codes, and cryptography·2025
Same journal

Knot theory and error-correcting codes.

Designs, codes, and cryptography·2025
Same journal

New results on non-disjoint and classical strong external difference families.

Designs, codes, and cryptography·2025
Same journal

Guessing less and better: improved attacks on GIFT-64.

Designs, codes, and cryptography·2025
Same journal

Conjunctive hierarchical secret sharing by finite geometry.

Designs, codes, and cryptography·2025
See all related articles

Related Experiment Video

Updated: Jan 18, 2026

DNA-Tethered RNA Polymerase for Programmable In vitro Transcription and Molecular Computation
09:26

DNA-Tethered RNA Polymerase for Programmable In vitro Transcription and Molecular Computation

Published on: December 29, 2021

4.8K

New nonbinary code bounds based on divisibility arguments.

Sven C Polak1

  • 1Korteweg-De Vries Institute for Mathematics, University of Amsterdam, Amsterdam, The Netherlands.

Designs, Codes, and Cryptography
|October 1, 2019
PubMed
Summary
This summary is machine-generated.

New upper bounds for error-correcting codes were derived using divisibility arguments and a correspondence with symmetric nets. These findings advance coding theory and the design of efficient error-correcting codes.

Keywords:
CodeDivisibilityKirkman systemNonbinary codeSymmetric netUpper bounds

More Related Videos

Author Spotlight: Validation of SICOLE-R for Assessing Cognitive and Reading Skills in Spanish-Speaking Children and Its Role in Personalized Education
09:00

Author Spotlight: Validation of SICOLE-R for Assessing Cognitive and Reading Skills in Spanish-Speaking Children and Its Role in Personalized Education

Published on: August 16, 2024

1.2K
BEST: Barcode Enabled Sequencing of Tetrads
12:59

BEST: Barcode Enabled Sequencing of Tetrads

Published on: May 1, 2014

10.6K

Related Experiment Videos

Last Updated: Jan 18, 2026

DNA-Tethered RNA Polymerase for Programmable In vitro Transcription and Molecular Computation
09:26

DNA-Tethered RNA Polymerase for Programmable In vitro Transcription and Molecular Computation

Published on: December 29, 2021

4.8K
Author Spotlight: Validation of SICOLE-R for Assessing Cognitive and Reading Skills in Spanish-Speaking Children and Its Role in Personalized Education
09:00

Author Spotlight: Validation of SICOLE-R for Assessing Cognitive and Reading Skills in Spanish-Speaking Children and Its Role in Personalized Education

Published on: August 16, 2024

1.2K
BEST: Barcode Enabled Sequencing of Tetrads
12:59

BEST: Barcode Enabled Sequencing of Tetrads

Published on: May 1, 2014

10.6K

Area of Science:

  • Coding Theory
  • Combinatorics
  • Discrete Mathematics

Background:

  • Understanding the maximum size of error-correcting codes (k) for a given minimum distance (d) is crucial in information theory.
  • Existing bounds provide theoretical limits, but tighter bounds are needed for practical applications.

Purpose of the Study:

  • To establish new, improved upper bounds for the size of error-correcting codes.
  • To explore the relationship between error-correcting codes and combinatorial designs (symmetric nets).

Main Methods:

  • A novel divisibility argument was employed to derive new upper bounds.
  • A one-to-one correspondence was proven between symmetric nets and specific types of codes.
  • These bounds were derived from the properties of 'symmetric net' codes.

Main Results:

  • New upper bounds for code size (k) were established, including k <= ..., k <= ..., and k <= ...
  • Further improved upper bounds were derived: k <= ..., k <= ..., k <= ..., and k <= ...
  • The established correspondence provides a new perspective on the structure of certain codes.

Conclusions:

  • The divisibility argument and symmetric net correspondence offer significant advancements in determining the maximum size of error-correcting codes.
  • These findings contribute to the theoretical understanding and practical design of efficient coding schemes.