Pages that link to "Item:Q579215"
From MaRDI portal
The following pages link to Computational complexity of bilinear forms. Algebraic coding theory and applications to digital communication systems (Q579215):
Displaying 6 items.
- Symmetric bilinear forms over finite fields with applications to coding theory (Q494308) (← links)
- Multiplicative complexity of bilinear algorithms for cyclic convolution over finite fields (Q751615) (← links)
- Weight enumerators of codes derived from polynomial product algorithms (Q1356476) (← links)
- Bilinear forms and linear codes (Q1431130) (← links)
- On a signal processing algorithms based class of linear codes (Q1803557) (← links)
- (Q3184632) (← links)