7,876 research outputs found

    List Decodability at Small Radii

    Full text link
    A′(n,d,e)A'(n,d,e), the smallest ℓ\ell for which every binary error-correcting code of length nn and minimum distance dd is decodable with a list of size ℓ\ell up to radius ee, is determined for all d≥2e−3d\geq 2e-3. As a result, A′(n,d,e)A'(n,d,e) is determined for all e≤4e\leq 4, except for 42 values of nn.Comment: to appear in Designs, Codes, and Cryptography (accepted October 2010

    Passenger sharing of the high-speed railway from sensitivity analysis caused by price and run-time based on the multi-agent system

    Get PDF
    Purpose: Nowadays, governments around the world are active in constructing the high-speed railway. Therefore, it is significant to make research on this increasingly prevalent transport. Design/methodology/approach: In this paper, we simulate the process of the passenger’s travel mode choice by adjusting the ticket fare and the run-time based on the multi-agent system (MAS). Findings: From the research we get the conclusion that increasing the run-time appropriately and reducing the ticket fare in some extent are effective ways to enhance the passenger sharing of the high-speed railway. Originality/value: We hope it can provide policy recommendations for the railway sectors in developing the long-term plan on high-speed railway in the future.Peer Reviewe
    • …
    corecore