The following pages link to Bal Kishan Dass (Q585164):
Displaying 50 items.
- An odd kind of BCH code (Q385149) (← links)
- (Q505667) (redirect page) (← links)
- Undeniable signature scheme based over group ring (Q505668) (← links)
- Codes on Grassmann bundles and related varieties (Q555974) (← links)
- Burst distribution of a linear code (Q585167) (← links)
- (Q587169) (redirect page) (← links)
- Han's bijection via permutation codes (Q616374) (← links)
- Cyclotomy and its application to duadic codes (Q623246) (← links)
- Self-dual codes over commutative Frobenius rings (Q623247) (← links)
- Decomposability of the mod \(p\) Whitehead element (Q674587) (← links)
- Highly symmetric subgraphs of hypercubes (Q686980) (← links)
- Parity encoding of binary sequences (Q697641) (← links)
- Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3 (Q735031) (← links)
- Multiplicative complexity of bilinear algorithms for cyclic convolution over finite fields (Q751615) (← links)
- Weight polarization and divisibility (Q751625) (← links)
- Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron (Q756763) (← links)
- The Tietäväinen bound for spherical codes (Q759729) (← links)
- A counterexample to the triangle conjecture (Q762613) (← links)
- Some aspects of perfect elimination orderings in chordal graphs (Q792351) (← links)
- Ternary and binary codes for a plane of order 12 (Q792952) (← links)
- On linear codes which attain the Solomon-Stiffler bound (Q798293) (← links)
- Notes on the value function (Q849349) (← links)
- \(\mathbb Z_2\mathbb Z_4\)-linear codes: Generator matrices and duality (Q849365) (← links)
- Some properties of the twisted Grassmann graphs (Q852440) (← links)
- The lengths of Hermitian self-dual extended duadic codes (Q863912) (← links)
- The divisibility modulo 24 of Kloosterman sums on \(\text{GF}(2^m)\), \(m\) odd (Q868885) (← links)
- An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings (Q871618) (← links)
- Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice (Q882790) (← links)
- Codes over a subset of octonion integers (Q889135) (← links)
- On the equivalence of codes and codes with an automorphism having two cycles (Q920923) (← links)
- A new combinatorial approach to the construction of constant composition codes (Q931533) (← links)
- On decomposability of 4-ary distance 2 MDS codes, double-codes, and \(n\)-quasigroups of order 4 (Q932607) (← links)
- Quasi-cyclic codes as codes over rings of matrices (Q964418) (← links)
- A class of constacyclic codes over \(\mathbb Z_{p^m}\) (Q982479) (← links)
- Privacy-preserving distributed algorithm for sparse vector sum (Q983854) (← links)
- On perfect-like binary and non-binary linear codes - a brief survey (Q1024589) (← links)
- Partial permutation decoding for the first-order Reed-Muller codes (Q1025449) (← links)
- Full rank perfect codes and \(\alpha \)-kernels (Q1025476) (← links)
- Results on rotation symmetric bent functions (Q1025497) (← links)
- An impossibility result on graph secret sharing (Q1039271) (← links)
- Divisibility properties of classical binary Kloosterman sums (Q1043564) (← links)
- Generalized weighing matrices and self-orthogonal codes (Q1044936) (← links)
- On the nonbinary Johnson scheme (Q1066117) (← links)
- Theory of codes with maximum rank distance (Q1071731) (← links)
- Generalized bent functions and their properties (Q1071735) (← links)
- Linear intersecting codes (Q1072521) (← links)
- On fixed point results (Q1098396) (← links)
- Fixed point theorems for three maps in uniform spaces (Q1098397) (← links)
- On weights of bursts (Q1137560) (← links)
- A fixed point theorem concerning iterates of a mapping (Q1145339) (← links)
