• Publications
  • Influence
Strengthening the Gilbert–Varshamov bound
Abstract The paper discusses some ways to strengthen (nonasymptotically) the Gilbert–Varshamov bound for linear codes. The unifying idea is to study a certain graph constructed on vectors of lowExpand
  • 12
  • 2
  • PDF
The degree of functions and weights in linear codes
TLDR
Weight distribution of low-dimensional generalized Reed–Muller codes are used to obtain restrictions on the weight distribution of linear codes over arbitrary fields. Expand
  • 4
  • 1
Restrictions on the Weight Distribution of Linear Codes
  • 4
Some bounds for the minimum length of binary linear codes of dimension nine
TLDR
Using the residual code technique, the MacWilliams identities and the weight distribution of appropriate Reed-Muller codes, we prove that n(k, d) is the smallest integer n for which a binary linear code of length n, dimension k, and minimum distance d exists. Expand
  • 6
  • PDF
Restrictions on the weight distribution of quaternary linear codes
TLDR
This paper describes some nonexistence results for quaternary linear codes. Expand
Analisis dan Penerapan Algoritma RIPEMD-160 Sebagai Fungsi Penyandi dalam Proses Autentikasi Password
TLDR
Analisis dan Penerapan Algoritma RIPEMD-160 Sebagai Fungsi Penyandi dalam Proses Autentikasi . Expand
Algoritme Blowfish untuk Peyandian Pesan