SelfDual Z4Modules: Advanced Text in Coding theory,Used

SelfDual Z4Modules: Advanced Text in Coding theory,Used

In Stock
SKU: DADAX3844398570
Brand: LAP Lambert Academic Publishing
Condition: New
Regular price$88.61
Quantity
Add to wishlist
Add to compare

Sold by Ergodebooks, an authorized reseller.

Returns accepted within 30 days | support@ergodebooks.com

Verified
Shipping Information
  • Free Standard Shipping — United States only
  • Processing Time: 1–3 business days
  • Estimated Delivery: 3–5 business days after dispatch
  • Double-boxed, fully insured & discreetly packaged
  • Tracking number sent via email once dispatched
  • Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund

Returns accepted within 30 days of delivery.

Damaged or Defective Item

Free return shipping + replacement or full refund

Wrong Item Received

Free return shipping + replacement or full refund

Change of Mind

Return shipping at customer's expense · 25% restocking fee applies

All returns require a Return Authorization (RA) number before sending.

To initiate a return, contact us:

support@ergodebooks.com +1 (281) 738-1050
View Full Return & Refund Policy
Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

In this book we apply the Bordering of vectors of length n over the ring Z4. This ordering is a generalization of the Bordering deinedfor vectors over binary field Z2, and over the prime field Zp.Then we study greedy codes generated by this ordering over the ring Z4 using Lee distance. Also we modify the greedy algorithm to anotherone called almost" greedy. By this algorithm we show that codes and selforthogonal codes generated by using Bordering for Lee distanceare linear codes over Z4.An extension and a generalization of these results are applied to another ring of four alphabets which is F2 + uF2.Finally we study linear codes over the rings Z4 and F2+uF2 of constant Lee weight using the almost greedy algorithm and also the additive greedy codes over the ring Z2 x Z2.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed