Abstract
<p>Consider a set of vectors, <em>L</em>, which consists of vectors whose coordinates are 0 or 1. We find explicit formulas that counts the number of lattice paths from origin to (<em>a</em>,<em>b</em>,<em>c</em>,<em>d</em>) for using vectors in {(1,0,0,0),(0,1,0,0),(0,0,1,0),(0,0,0,1)} ∪ <em>L</em> for various choices of <em>L</em>. In some cases we also give the recursive formulas for the same problem. Next we determine the minimum number of vectors that must be used to reach (<em>a</em>,<em>b</em>,<em>c</em>,<em>d</em>), also called the minimum distance problem, for different sets of vectors.</p>
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
