Piroska Lakatos

Learn More
The first author [1] proved that all zeros of the reciprocal polynomial Pm(z) = m ∑ k=0 Akz k (z ∈ C), of degree m ≥ 2 with real coefficients Ak ∈ R (i.e. Am 6= 0 and Ak = Am−k for all k = 0, . . . , [ m 2 ] ) are on the unit circle, provided that |Am| ≥ m ∑ k=0 |Ak −Am| = m−1 ∑ k=1 |Ak −Am|. Moreover, the zeros of Pm are near to the m + 1st roots of unity(More)
A linear code C is called a group code if C is an ideal in a group algebra K[G] where K is a ring and G is a finite group. Many classical linear error-correcting codes can be realized as ideals of group algebras. Berman [1], in the case of characteristic 2, and Charpin [2], for characteristic p = 2, proved that all generalized Reed–Muller codes coincide(More)
  • 1