The following pages link to Bal Kishan Dass (Q585164):
Displaying 50 items.
- A theorem on fixed points concerning iterates of a mapping (Q1145340) (← links)
- A bound for random and closed loop burst error detecting codes (Q1148292) (← links)
- Bounds on blockwise burst error correcting linear codes (Q1148865) (← links)
- A note on Reed-Muller codes (Q1149422) (← links)
- A new type of \((1,2)\)-optimal codes over \(\mathrm{GF}(2)\) (Q1168946) (← links)
- Projective equivalence of matroids with coefficients (Q1176375) (← links)
- On the parameters of codes for the Lee and modular distance (Q1176746) (← links)
- Bruck nets, codes, and characters of loops (Q1179515) (← links)
- A limit property of arbitrary information source (Q1179947) (← links)
- The average intersection number of a pair of self-dual codes (Q1185409) (← links)
- Eulerian numbers, tableaux, and the Betti numbers of a toric variety (Q1191958) (← links)
- A linear time algorithm for computing 3-edge-connected components in a multigraph (Q1199755) (← links)
- On minimum distance bounds for abelian codes (Q1205130) (← links)
- Bounds for burst-error and random-error correcting linear codes (Q1242145) (← links)
- A sufficient condition for the existence of high-density-burst correcting linear codes (Q1242875) (← links)
- An extension of Banach contraction principle through rational expression (Q1243501) (← links)
- On fixed point theorems for product of metric spaces (Q1252648) (← links)
- On linear programming bounds for codes in polynomial metric spaces (Q1276778) (← links)
- Coverings, heat kernels and spanning trees (Q1277788) (← links)
- Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications (Q1292857) (← links)
- A note on covering the edges of a graph with bonds (Q1292867) (← links)
- Closure and Hamiltonian-connectivity of claw-free graphs (Q1296972) (← links)
- A connection between fixed-point theorems and tiling problems (Q1304626) (← links)
- A strengthening of Brooks' theorem (Q1306303) (← links)
- Subdivisions and chromatic roots (Q1306307) (← links)
- Norm-graphs: Variations and applications (Q1306316) (← links)
- \(\Delta\)-matroids with the strong exchange conditions (Q1312044) (← links)
- The computability problem in algebraic topology (Q1328492) (← links)
- The parallel solution of domination problems on chordal and strongly chordal graphs (Q1331893) (← links)
- Canonical cactus representation for miminum cuts (Q1343494) (← links)
- Codes derived from binary Goppa codes (Q1347392) (← links)
- Bi-complement reducible graphs (Q1356114) (← links)
- On the minimum length of \(q\)-ary linear codes of dimension five (Q1360280) (← links)
- Rectangle-visibility representations of bipartite graphs (Q1363757) (← links)
- A cascade proof of a finite vectors theorem (Q1377374) (← links)
- Classification of extremal double circulant self-dual codes of lengths 64 to 72 (Q1381621) (← links)
- Combinatorial properties of codes with degree \(n\) (Q1395008) (← links)
- Sudan-decoding generalized geometric Goppa codes. (Q1400974) (← links)
- Inertia and biclique decompositions of joins of graphs (Q1405108) (← links)
- Exact bounds on the sizes of covering codes (Q1406876) (← links)
- On the computation of coset leaders with high Hamming weight. (Q1421523) (← links)
- Generator polynomials of characteristic ideal of maximal periodic arrays over Galois rings. (Q1427475) (← links)
- Beyond the orthogonal array concept. (Q1427968) (← links)
- MacWilliams relations for spherical orbit codes. (Q1432277) (← links)
- Binary quasi-cyclic Goppa codes (Q1580537) (← links)
- On constructible graphs, infinite bridged graphs and weakly cop-win graphs (Q1586757) (← links)
- Cycle index series of structures over digraphs (Q1586766) (← links)
- Secret sharing schemes with detection of cheaters for a general access structure (Q1598871) (← links)
- Codes and anticodes in the Grassman graph (Q1604569) (← links)
- New design of quaternary sequences (Q1606068) (← links)
