Related Concept Videos
Second Order systems II
Constraints and Statical Determinacy
Routh-Hurwitz Criterion II
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first...
Routh-Hurwitz Criterion I
To apply the Routh-Hurwitz criterion, a Routh table is constructed. The table's rows are labeled with powers of the complex frequency variable s, starting from the...
Second Order systems I
By reinterpreting the system, one can derive the closed-loop transfer function, which...
Stability of Equilibrium Configuration: Problem Solving
Problem-solving in the context of the stability of equilibrium configuration...
You might also read
Related Articles
Articles linked to this work by shared authors, journal, and citation graph.
On the Optimal File Size of Capacity-Achieving Byzantine-Resistant Private Information Retrieval Schemes.
Research on a Regional Availability Evaluation Model for Road-Area High-Entropy Energy Based on Synergy Factors.
Atmospheric Turbulence Channel Modeling and Performance Analysis of a CO-ZP-OFDM Coherent Optical Communication System for UAV Air-to-Ground Scenarios.
Information Geometry and Asymptotic Theory for SMML Estimators.
Research on the Contagion of Systemic Financial Risk Under the Impact of Climate Risks-From the Perspective of Complex Networks and Machine Learning.
The Statistical-Mechanical Meaning of the Wave Function of Quantum Mechanics.
Related Experiment Video
Updated: Jun 27, 2025

Setting Limits on Supersymmetry Using Simplified Models
Published on: November 15, 2013
Evaluating the Gilbert-Varshamov Bound for Constrained Systems.
1School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore 637121, Singapore.
This study presents numerical procedures to compute Gilbert-Varshamov (GV) bounds for constrained systems. Simplified methods and explicit formulas are derived for specific graph presentations, enhancing bound computation.
Area of Science:
- Information Theory
- Coding Theory
- Discrete Mathematics
Background:
- The Gilbert-Varshamov (GV) bound is a fundamental result in coding theory.
- Previous work established connections between the GV bound and optimization problems.
- Improvements to the GV bound were proposed by Marcus and Roth.
Purpose of the Study:
- To provide explicit numerical procedures for computing the GV bound.
- To simplify the computation of the GV bound through graphical methods.
- To derive explicit formulas for the GV bound in single-state graph scenarios.
Main Methods:
- Solving optimization problems related to the GV bound.
- Developing numerical algorithms for bound computation.
- Analyzing graphical representations of the optimization problems.
Main Results:
- Explicit numerical procedures for calculating the GV bound are presented.
- The computational procedures are simplified by plotting curves.
- Explicit formulas for the GV bound are derived for single-state graphs.
Conclusions:
- The study offers practical methods for computing GV bounds.
- Graphical analysis simplifies complex optimization problems.
- Specific formulas enhance the applicability of GV bounds in certain cases.

