Pages that link to "Item:Q3866012"

The following pages link to On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound (Q3866012):

Displaying 22 items.

• On linear codes which attain the Solomon-Stiffler bound (Q798293) (← links)
• A characterization of some minihypers in a finite projective geometry PG(t,4) (Q804949) (← links)
• On the cosets of the simplex code (Q1072523) (← links)
• An improvement of the Griesmer bound for some small minimum distances (Q1083427) (← links)
• Characterization of \(\{(q+1)+2,1;t,q\}-\min \cdot hypers\) and \(\{2(q+1)+2,2;2,q\}-\min \cdot hypers\) in a finite projective geometry (Q1113453) (← links)
• Characterization of \(\{v_{\mu +1}+2v_{\mu},v_{\mu}+2v_{\mu - 1};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes (Q1120542) (← links)
• Characterization of \(\{2(q+1)+2,2;t,q\}\)-\(\min \cdot hypers\) in PG(t,q) (t\(\geq 3,q\geq 5)\) and its applications to error-correcting codes (Q1124583) (← links)
• A characterization of \(\{v_{\mu +1}+\epsilon,v_{\mu};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes and factorial designs (Q1124584) (← links)
• The smallest length of binary 7-dimensional linear codes with prescribed minimum distance (Q1151870) (← links)
• A note on the covering radius of optimum codes (Q1180145) (← links)
• A characterization of \(\{ 2\upsilon{}_{\alpha{}+1}+2\upsilon{}_{\beta{}+1},2\upsilon_ \alpha{}+2\upsilon{}_ \beta{} ;t,q\}\)-minihypers in PG\((t,q)(t\geq 2,q\geq 5\) and \(0\leq\alpha{}<\beta{}<t)\) and its applications to error- correcting codes (Q1182872) (← links)
• A characterization of some \(\{2v_{\alpha{}+1}+v_{\gamma{}+1},2v_ \alpha{}+v_ \gamma{};k-1,3\}\)-minihypers and some \((n,k,3^{k-1}- 2\cdot{}3^ \alpha{}-3^ \gamma{};3)\)-codes \((k\geq{}3,\;0 \leq{}\alpha{}< \gamma{}< k-1)\) meeting the Griesmer bound (Q1197005) (← links)
• A characterization of some \(\{v_ 2+2v_ 3,v_ 1+2v_ 2;k-1,3\}\)-minihypers and some \((v_ k-30,k,3^{k-1}-21;3)\)-codes meeting the Griesmer bound (Q1209669) (← links)
• A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry (Q1802134) (← links)
• A construction of some \([n,k,d;q]\)-codes meeting the Griesmer bound (Q1802135) (← links)
• On linear projective codes which satisfy the chain condition. (Q1961821) (← links)
• Hamming distances of constacyclic codes of length \(3p^s\) and optimal codes with respect to the Griesmer and Singleton bounds (Q1995224) (← links)
• On the minimum weights of binary linear complementary dual codes (Q2179521) (← links)
• Sufficient conditions for monotonicity of the undetected error probability for large channel error probabilities (Q2432944) (← links)
• Optimal subcodes and optimum distance profiles of self-dual codes (Q2434399) (← links)
• On the Construction of Binary Optimal LCD Codes with Short Length (Q5207033) (← links)
• New upper bounds and constructions of multi-erasure locally recoverable codes (Q6107451) (← links)